./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/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 9f9c3a25932676bec80072ad05bb4d96280afa80 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:59:30,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:59:30,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:59:30,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:59:30,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:59:30,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:59:30,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:59:30,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:59:30,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:59:30,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:59:30,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:59:30,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:59:30,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:59:30,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:59:30,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:59:30,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:59:30,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:59:30,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:59:30,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:59:30,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:59:30,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:59:30,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:59:30,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:59:30,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:59:30,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:59:30,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:59:30,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:59:30,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:59:30,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:59:30,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:59:30,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:59:30,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:59:30,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:59:30,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:59:30,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:59:30,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:59:30,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:59:30,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:59:30,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:59:30,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:59:30,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:59:30,869 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:59:30,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:59:30,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:59:30,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:59:30,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:59:30,917 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:59:30,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:59:30,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:59:30,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:59:30,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:59:30,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:59:30,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:59:30,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:59:30,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:59:30,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:59:30,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:59:30,922 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:59:30,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:59:30,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:59:30,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:59:30,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:59:30,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:59:30,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:59:30,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:59:30,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:59:30,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:59:30,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:59:30,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:59:30,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:59:30,925 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_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/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 -> 9f9c3a25932676bec80072ad05bb4d96280afa80 [2019-11-20 00:59:31,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:59:31,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:59:31,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:59:31,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:59:31,171 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:59:31,173 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2019-11-20 00:59:31,258 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/data/19ad60f79/1bfa2e62807849abbe9803addaf3b602/FLAG2d7cc95a7 [2019-11-20 00:59:31,935 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:59:31,935 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2019-11-20 00:59:31,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/data/19ad60f79/1bfa2e62807849abbe9803addaf3b602/FLAG2d7cc95a7 [2019-11-20 00:59:32,127 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/data/19ad60f79/1bfa2e62807849abbe9803addaf3b602 [2019-11-20 00:59:32,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:59:32,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:59:32,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:59:32,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:59:32,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:59:32,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:59:32" (1/1) ... [2019-11-20 00:59:32,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edc5214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:32, skipping insertion in model container [2019-11-20 00:59:32,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:59:32" (1/1) ... [2019-11-20 00:59:32,156 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:59:32,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:59:32,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:59:32,789 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:59:33,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:59:33,065 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:59:33,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33 WrapperNode [2019-11-20 00:59:33,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:59:33,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:59:33,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:59:33,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:59:33,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:59:33,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:59:33,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:59:33,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:59:33,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... [2019-11-20 00:59:33,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:59:33,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:59:33,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:59:33,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:59:33,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:59:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:59:33,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:59:35,484 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:59:35,485 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:59:35,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:59:35 BoogieIcfgContainer [2019-11-20 00:59:35,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:59:35,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:59:35,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:59:35,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:59:35,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:59:32" (1/3) ... [2019-11-20 00:59:35,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21adf5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:59:35, skipping insertion in model container [2019-11-20 00:59:35,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:59:33" (2/3) ... [2019-11-20 00:59:35,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21adf5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:59:35, skipping insertion in model container [2019-11-20 00:59:35,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:59:35" (3/3) ... [2019-11-20 00:59:35,502 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label48.c [2019-11-20 00:59:35,514 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:59:35,524 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:59:35,548 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:59:35,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:59:35,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:59:35,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:59:35,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:59:35,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:59:35,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:59:35,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:59:35,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:59:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-20 00:59:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 00:59:35,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:35,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:35,648 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2019-11-20 00:59:35,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:35,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572120981] [2019-11-20 00:59:35,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:59:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572120981] [2019-11-20 00:59:36,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:59:36,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:59:36,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601693073] [2019-11-20 00:59:36,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:59:36,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:59:36,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:59:36,072 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-20 00:59:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:38,660 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-20 00:59:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:59:38,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-20 00:59:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:38,685 INFO L225 Difference]: With dead ends: 850 [2019-11-20 00:59:38,685 INFO L226 Difference]: Without dead ends: 538 [2019-11-20 00:59:38,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:59:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-20 00:59:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-20 00:59:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-20 00:59:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-11-20 00:59:38,776 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 38 [2019-11-20 00:59:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:38,777 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-11-20 00:59:38,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:59:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-11-20 00:59:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 00:59:38,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:38,785 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:38,785 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1126953967, now seen corresponding path program 1 times [2019-11-20 00:59:38,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:38,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538006158] [2019-11-20 00:59:38,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:59:39,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538006158] [2019-11-20 00:59:39,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:59:39,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:59:39,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096146985] [2019-11-20 00:59:39,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:59:39,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:59:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:59:39,051 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-11-20 00:59:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:40,663 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2019-11-20 00:59:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:59:40,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 00:59:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:40,675 INFO L225 Difference]: With dead ends: 2142 [2019-11-20 00:59:40,676 INFO L226 Difference]: Without dead ends: 1606 [2019-11-20 00:59:40,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:59:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-20 00:59:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-20 00:59:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-20 00:59:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1993 transitions. [2019-11-20 00:59:40,762 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1993 transitions. Word has length 120 [2019-11-20 00:59:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:40,763 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1993 transitions. [2019-11-20 00:59:40,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:59:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1993 transitions. [2019-11-20 00:59:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:59:40,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:40,777 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:40,777 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1627228242, now seen corresponding path program 1 times [2019-11-20 00:59:40,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:40,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179446437] [2019-11-20 00:59:40,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:59:40,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179446437] [2019-11-20 00:59:40,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:59:40,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:59:40,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673761686] [2019-11-20 00:59:40,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:59:40,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:59:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:59:40,992 INFO L87 Difference]: Start difference. First operand 1428 states and 1993 transitions. Second operand 4 states. [2019-11-20 00:59:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:42,521 INFO L93 Difference]: Finished difference Result 4990 states and 7108 transitions. [2019-11-20 00:59:42,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:59:42,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-20 00:59:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:42,547 INFO L225 Difference]: With dead ends: 4990 [2019-11-20 00:59:42,547 INFO L226 Difference]: Without dead ends: 3564 [2019-11-20 00:59:42,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:59:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-20 00:59:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2852. [2019-11-20 00:59:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 00:59:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3785 transitions. [2019-11-20 00:59:42,640 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3785 transitions. Word has length 183 [2019-11-20 00:59:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:42,641 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3785 transitions. [2019-11-20 00:59:42,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:59:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3785 transitions. [2019-11-20 00:59:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 00:59:42,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:42,659 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:42,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash -233481583, now seen corresponding path program 1 times [2019-11-20 00:59:42,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:42,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010815573] [2019-11-20 00:59:42,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:59:43,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010815573] [2019-11-20 00:59:43,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480516897] [2019-11-20 00:59:43,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:43,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:59:43,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:59:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-20 00:59:43,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:59:43,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 00:59:43,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345660847] [2019-11-20 00:59:43,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:59:43,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:59:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:59:43,345 INFO L87 Difference]: Start difference. First operand 2852 states and 3785 transitions. Second operand 3 states. [2019-11-20 00:59:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:44,456 INFO L93 Difference]: Finished difference Result 6592 states and 8699 transitions. [2019-11-20 00:59:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:59:44,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-20 00:59:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:44,481 INFO L225 Difference]: With dead ends: 6592 [2019-11-20 00:59:44,482 INFO L226 Difference]: Without dead ends: 3564 [2019-11-20 00:59:44,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:59:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-20 00:59:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2674. [2019-11-20 00:59:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-20 00:59:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3524 transitions. [2019-11-20 00:59:44,573 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3524 transitions. Word has length 197 [2019-11-20 00:59:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:44,575 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3524 transitions. [2019-11-20 00:59:44,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:59:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3524 transitions. [2019-11-20 00:59:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-20 00:59:44,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:44,584 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:44,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:44,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1453272931, now seen corresponding path program 1 times [2019-11-20 00:59:44,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:44,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813257272] [2019-11-20 00:59:44,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 00:59:45,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813257272] [2019-11-20 00:59:45,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430466325] [2019-11-20 00:59:45,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:45,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:59:45,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:59:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 00:59:45,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:59:45,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 00:59:45,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104107771] [2019-11-20 00:59:45,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:59:45,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:59:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:59:45,482 INFO L87 Difference]: Start difference. First operand 2674 states and 3524 transitions. Second operand 4 states. [2019-11-20 00:59:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:46,561 INFO L93 Difference]: Finished difference Result 5553 states and 7259 transitions. [2019-11-20 00:59:46,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:59:46,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-20 00:59:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:46,580 INFO L225 Difference]: With dead ends: 5553 [2019-11-20 00:59:46,580 INFO L226 Difference]: Without dead ends: 2852 [2019-11-20 00:59:46,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:59:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-20 00:59:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-11-20 00:59:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-20 00:59:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3011 transitions. [2019-11-20 00:59:46,652 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3011 transitions. Word has length 308 [2019-11-20 00:59:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:46,652 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3011 transitions. [2019-11-20 00:59:46,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:59:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3011 transitions. [2019-11-20 00:59:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-20 00:59:46,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:46,664 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:46,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:46,868 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1536337896, now seen corresponding path program 1 times [2019-11-20 00:59:46,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:46,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997509521] [2019-11-20 00:59:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 398 proven. 65 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:59:47,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997509521] [2019-11-20 00:59:47,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315724475] [2019-11-20 00:59:47,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:47,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:59:47,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:59:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 00:59:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:59:48,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-20 00:59:48,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038041008] [2019-11-20 00:59:48,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:59:48,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:59:48,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:59:48,423 INFO L87 Difference]: Start difference. First operand 2674 states and 3011 transitions. Second operand 7 states. [2019-11-20 00:59:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:49,623 INFO L93 Difference]: Finished difference Result 5574 states and 6254 transitions. [2019-11-20 00:59:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:59:49,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 403 [2019-11-20 00:59:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:49,642 INFO L225 Difference]: With dead ends: 5574 [2019-11-20 00:59:49,642 INFO L226 Difference]: Without dead ends: 2852 [2019-11-20 00:59:49,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:59:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-20 00:59:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-11-20 00:59:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-20 00:59:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2954 transitions. [2019-11-20 00:59:49,714 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2954 transitions. Word has length 403 [2019-11-20 00:59:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:49,725 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2954 transitions. [2019-11-20 00:59:49,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:59:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2954 transitions. [2019-11-20 00:59:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-11-20 00:59:49,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:49,741 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:49,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:49,955 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash 929105321, now seen corresponding path program 1 times [2019-11-20 00:59:49,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:49,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031020392] [2019-11-20 00:59:49,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 569 proven. 4 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:59:50,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031020392] [2019-11-20 00:59:50,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586746501] [2019-11-20 00:59:50,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:51,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:59:51,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:59:51,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:59:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 550 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:59:51,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:59:51,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-20 00:59:51,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868640385] [2019-11-20 00:59:51,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:59:51,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:59:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:59:51,733 INFO L87 Difference]: Start difference. First operand 2674 states and 2954 transitions. Second operand 8 states. [2019-11-20 00:59:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:54,224 INFO L93 Difference]: Finished difference Result 6109 states and 6687 transitions. [2019-11-20 00:59:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 00:59:54,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 530 [2019-11-20 00:59:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:54,246 INFO L225 Difference]: With dead ends: 6109 [2019-11-20 00:59:54,247 INFO L226 Difference]: Without dead ends: 3437 [2019-11-20 00:59:54,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:59:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2019-11-20 00:59:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2674. [2019-11-20 00:59:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-20 00:59:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2952 transitions. [2019-11-20 00:59:54,316 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2952 transitions. Word has length 530 [2019-11-20 00:59:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:54,317 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2952 transitions. [2019-11-20 00:59:54,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:59:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2952 transitions. [2019-11-20 00:59:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-11-20 00:59:54,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:54,343 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:59:54,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:54,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:54,556 INFO L82 PathProgramCache]: Analyzing trace with hash -69619708, now seen corresponding path program 1 times [2019-11-20 00:59:54,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:54,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824019445] [2019-11-20 00:59:54,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:59:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 664 proven. 174 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-11-20 00:59:56,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824019445] [2019-11-20 00:59:56,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371136957] [2019-11-20 00:59:56,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:59:56,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:59:56,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:59:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 809 proven. 29 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-11-20 00:59:57,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:59:57,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-20 00:59:57,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413871091] [2019-11-20 00:59:57,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:59:57,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:59:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:59:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:59:57,699 INFO L87 Difference]: Start difference. First operand 2674 states and 2952 transitions. Second operand 8 states. [2019-11-20 00:59:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:59:59,648 INFO L93 Difference]: Finished difference Result 6111 states and 6693 transitions. [2019-11-20 00:59:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:59:59,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 664 [2019-11-20 00:59:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:59:59,668 INFO L225 Difference]: With dead ends: 6111 [2019-11-20 00:59:59,668 INFO L226 Difference]: Without dead ends: 3439 [2019-11-20 00:59:59,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 661 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:59:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2019-11-20 00:59:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2852. [2019-11-20 00:59:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 00:59:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3134 transitions. [2019-11-20 00:59:59,742 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3134 transitions. Word has length 664 [2019-11-20 00:59:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:59:59,744 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3134 transitions. [2019-11-20 00:59:59,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:59:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3134 transitions. [2019-11-20 00:59:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-11-20 00:59:59,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:59:59,753 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:59:59,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:59:59,958 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:59:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash -711897079, now seen corresponding path program 1 times [2019-11-20 00:59:59,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:59:59,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186026507] [2019-11-20 00:59:59,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-11-20 01:00:01,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186026507] [2019-11-20 01:00:01,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:01,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:00:01,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987441643] [2019-11-20 01:00:01,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:00:01,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:00:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:00:01,698 INFO L87 Difference]: Start difference. First operand 2852 states and 3134 transitions. Second operand 7 states. [2019-11-20 01:00:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:03,654 INFO L93 Difference]: Finished difference Result 6295 states and 6875 transitions. [2019-11-20 01:00:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:00:03,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 675 [2019-11-20 01:00:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:03,675 INFO L225 Difference]: With dead ends: 6295 [2019-11-20 01:00:03,676 INFO L226 Difference]: Without dead ends: 3445 [2019-11-20 01:00:03,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:00:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-11-20 01:00:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3030. [2019-11-20 01:00:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-20 01:00:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3315 transitions. [2019-11-20 01:00:03,774 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3315 transitions. Word has length 675 [2019-11-20 01:00:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:03,776 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3315 transitions. [2019-11-20 01:00:03,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:00:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3315 transitions. [2019-11-20 01:00:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-20 01:00:03,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:03,787 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:03,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:03,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash 105793533, now seen corresponding path program 1 times [2019-11-20 01:00:03,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:03,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099064066] [2019-11-20 01:00:03,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 1070 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-11-20 01:00:04,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099064066] [2019-11-20 01:00:04,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:04,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:00:04,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332510090] [2019-11-20 01:00:04,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:00:04,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:00:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:00:04,499 INFO L87 Difference]: Start difference. First operand 3030 states and 3315 transitions. Second operand 3 states. [2019-11-20 01:00:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:05,162 INFO L93 Difference]: Finished difference Result 7304 states and 7950 transitions. [2019-11-20 01:00:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:00:05,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2019-11-20 01:00:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:05,187 INFO L225 Difference]: With dead ends: 7304 [2019-11-20 01:00:05,187 INFO L226 Difference]: Without dead ends: 4276 [2019-11-20 01:00:05,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:00:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-20 01:00:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3920. [2019-11-20 01:00:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-20 01:00:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4235 transitions. [2019-11-20 01:00:05,269 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4235 transitions. Word has length 691 [2019-11-20 01:00:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:05,270 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4235 transitions. [2019-11-20 01:00:05,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:00:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4235 transitions. [2019-11-20 01:00:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2019-11-20 01:00:05,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:05,283 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:05,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:05,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1452861494, now seen corresponding path program 1 times [2019-11-20 01:00:05,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:05,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178144897] [2019-11-20 01:00:05,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2019-11-20 01:00:06,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178144897] [2019-11-20 01:00:06,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:06,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:00:06,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35164209] [2019-11-20 01:00:06,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:00:06,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:00:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:00:06,097 INFO L87 Difference]: Start difference. First operand 3920 states and 4235 transitions. Second operand 4 states. [2019-11-20 01:00:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:07,096 INFO L93 Difference]: Finished difference Result 9084 states and 9866 transitions. [2019-11-20 01:00:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:00:07,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 846 [2019-11-20 01:00:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:07,109 INFO L225 Difference]: With dead ends: 9084 [2019-11-20 01:00:07,110 INFO L226 Difference]: Without dead ends: 4988 [2019-11-20 01:00:07,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:00:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-20 01:00:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2019-11-20 01:00:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-20 01:00:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4946 transitions. [2019-11-20 01:00:07,202 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4946 transitions. Word has length 846 [2019-11-20 01:00:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:07,204 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4946 transitions. [2019-11-20 01:00:07,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:00:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4946 transitions. [2019-11-20 01:00:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2019-11-20 01:00:07,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:07,217 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:07,217 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1223574979, now seen corresponding path program 1 times [2019-11-20 01:00:07,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:07,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519061834] [2019-11-20 01:00:07,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1576 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-11-20 01:00:09,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519061834] [2019-11-20 01:00:09,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:09,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:00:09,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557529160] [2019-11-20 01:00:09,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:00:09,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:00:09,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:00:09,386 INFO L87 Difference]: Start difference. First operand 4632 states and 4946 transitions. Second operand 7 states. [2019-11-20 01:00:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:10,603 INFO L93 Difference]: Finished difference Result 9265 states and 9896 transitions. [2019-11-20 01:00:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:00:10,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 864 [2019-11-20 01:00:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:10,615 INFO L225 Difference]: With dead ends: 9265 [2019-11-20 01:00:10,615 INFO L226 Difference]: Without dead ends: 4813 [2019-11-20 01:00:10,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:00:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2019-11-20 01:00:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4632. [2019-11-20 01:00:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-20 01:00:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4941 transitions. [2019-11-20 01:00:10,705 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4941 transitions. Word has length 864 [2019-11-20 01:00:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:10,706 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4941 transitions. [2019-11-20 01:00:10,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:00:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4941 transitions. [2019-11-20 01:00:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2019-11-20 01:00:10,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:10,720 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:10,720 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:10,721 INFO L82 PathProgramCache]: Analyzing trace with hash 377118381, now seen corresponding path program 1 times [2019-11-20 01:00:10,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:10,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427563599] [2019-11-20 01:00:10,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1705 proven. 144 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-20 01:00:11,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427563599] [2019-11-20 01:00:11,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278510508] [2019-11-20 01:00:11,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:00:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:12,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:00:12,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:00:12,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:00:12,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:00:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1490 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-11-20 01:00:14,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:00:14,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 01:00:14,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298605003] [2019-11-20 01:00:14,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:00:14,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:00:14,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:00:14,292 INFO L87 Difference]: Start difference. First operand 4632 states and 4941 transitions. Second operand 4 states. [2019-11-20 01:00:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:16,154 INFO L93 Difference]: Finished difference Result 9974 states and 10637 transitions. [2019-11-20 01:00:16,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:00:16,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 941 [2019-11-20 01:00:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:16,174 INFO L225 Difference]: With dead ends: 9974 [2019-11-20 01:00:16,174 INFO L226 Difference]: Without dead ends: 5522 [2019-11-20 01:00:16,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:00:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-11-20 01:00:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2019-11-20 01:00:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-20 01:00:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5492 transitions. [2019-11-20 01:00:16,281 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5492 transitions. Word has length 941 [2019-11-20 01:00:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:16,282 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 5492 transitions. [2019-11-20 01:00:16,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:00:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5492 transitions. [2019-11-20 01:00:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1164 [2019-11-20 01:00:16,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:16,301 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:00:16,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:00:16,515 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1057461046, now seen corresponding path program 1 times [2019-11-20 01:00:16,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:16,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367846261] [2019-11-20 01:00:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4520 backedges. 1081 proven. 0 refuted. 0 times theorem prover too weak. 3439 trivial. 0 not checked. [2019-11-20 01:00:17,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367846261] [2019-11-20 01:00:17,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:17,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:00:17,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114267297] [2019-11-20 01:00:17,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:00:17,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:00:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:00:17,848 INFO L87 Difference]: Start difference. First operand 5166 states and 5492 transitions. Second operand 4 states. [2019-11-20 01:00:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:18,848 INFO L93 Difference]: Finished difference Result 10330 states and 10987 transitions. [2019-11-20 01:00:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:00:18,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1163 [2019-11-20 01:00:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:18,861 INFO L225 Difference]: With dead ends: 10330 [2019-11-20 01:00:18,861 INFO L226 Difference]: Without dead ends: 5166 [2019-11-20 01:00:18,867 INFO L630 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-20 01:00:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-20 01:00:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2019-11-20 01:00:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-20 01:00:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5210 transitions. [2019-11-20 01:00:18,952 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5210 transitions. Word has length 1163 [2019-11-20 01:00:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:18,954 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5210 transitions. [2019-11-20 01:00:18,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:00:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5210 transitions. [2019-11-20 01:00:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-11-20 01:00:18,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:18,973 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:18,973 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -192069251, now seen corresponding path program 1 times [2019-11-20 01:00:18,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:18,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018137532] [2019-11-20 01:00:18,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 1883 proven. 0 refuted. 0 times theorem prover too weak. 2684 trivial. 0 not checked. [2019-11-20 01:00:20,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018137532] [2019-11-20 01:00:20,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:20,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:00:20,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201775082] [2019-11-20 01:00:20,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:00:20,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:20,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:00:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:00:20,462 INFO L87 Difference]: Start difference. First operand 4988 states and 5210 transitions. Second operand 4 states. [2019-11-20 01:00:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:21,393 INFO L93 Difference]: Finished difference Result 9974 states and 10422 transitions. [2019-11-20 01:00:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:00:21,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1181 [2019-11-20 01:00:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:21,402 INFO L225 Difference]: With dead ends: 9974 [2019-11-20 01:00:21,402 INFO L226 Difference]: Without dead ends: 4988 [2019-11-20 01:00:21,406 INFO L630 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-20 01:00:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-20 01:00:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2019-11-20 01:00:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-20 01:00:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5180 transitions. [2019-11-20 01:00:21,486 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5180 transitions. Word has length 1181 [2019-11-20 01:00:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:21,487 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5180 transitions. [2019-11-20 01:00:21,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:00:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5180 transitions. [2019-11-20 01:00:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2019-11-20 01:00:21,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:21,506 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:21,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -244585356, now seen corresponding path program 1 times [2019-11-20 01:00:21,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:21,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239861358] [2019-11-20 01:00:21,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4793 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2019-11-20 01:00:22,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239861358] [2019-11-20 01:00:22,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:22,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:00:22,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299595193] [2019-11-20 01:00:22,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:00:22,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:00:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:00:22,752 INFO L87 Difference]: Start difference. First operand 4988 states and 5180 transitions. Second operand 3 states. [2019-11-20 01:00:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:23,260 INFO L93 Difference]: Finished difference Result 10152 states and 10546 transitions. [2019-11-20 01:00:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:00:23,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1223 [2019-11-20 01:00:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:23,266 INFO L225 Difference]: With dead ends: 10152 [2019-11-20 01:00:23,266 INFO L226 Difference]: Without dead ends: 5344 [2019-11-20 01:00:23,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:00:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-11-20 01:00:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2019-11-20 01:00:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-20 01:00:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5180 transitions. [2019-11-20 01:00:23,350 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5180 transitions. Word has length 1223 [2019-11-20 01:00:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:23,352 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5180 transitions. [2019-11-20 01:00:23,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:00:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5180 transitions. [2019-11-20 01:00:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2019-11-20 01:00:23,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:23,371 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:23,371 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:23,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash 321945556, now seen corresponding path program 1 times [2019-11-20 01:00:23,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:23,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190008489] [2019-11-20 01:00:23,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 2515 proven. 12 refuted. 0 times theorem prover too weak. 2408 trivial. 0 not checked. [2019-11-20 01:00:25,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190008489] [2019-11-20 01:00:25,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663638741] [2019-11-20 01:00:25,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:00:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:25,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:00:25,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:00:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 2515 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2019-11-20 01:00:27,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:00:27,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 01:00:27,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304522797] [2019-11-20 01:00:27,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:00:27,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:00:27,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:00:27,265 INFO L87 Difference]: Start difference. First operand 4988 states and 5180 transitions. Second operand 3 states. [2019-11-20 01:00:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:27,971 INFO L93 Difference]: Finished difference Result 9796 states and 10179 transitions. [2019-11-20 01:00:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:00:27,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1287 [2019-11-20 01:00:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:27,977 INFO L225 Difference]: With dead ends: 9796 [2019-11-20 01:00:27,977 INFO L226 Difference]: Without dead ends: 4988 [2019-11-20 01:00:27,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 1287 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:00:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-20 01:00:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2019-11-20 01:00:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-20 01:00:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4950 transitions. [2019-11-20 01:00:28,037 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4950 transitions. Word has length 1287 [2019-11-20 01:00:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:28,038 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 4950 transitions. [2019-11-20 01:00:28,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:00:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4950 transitions. [2019-11-20 01:00:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2019-11-20 01:00:28,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:28,065 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:28,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:00:28,267 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 292188241, now seen corresponding path program 1 times [2019-11-20 01:00:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:28,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879700042] [2019-11-20 01:00:28,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 2751 proven. 0 refuted. 0 times theorem prover too weak. 5613 trivial. 0 not checked. [2019-11-20 01:00:30,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879700042] [2019-11-20 01:00:30,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:30,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:00:30,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219029314] [2019-11-20 01:00:30,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:00:30,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:30,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:00:30,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:00:30,645 INFO L87 Difference]: Start difference. First operand 4810 states and 4950 transitions. Second operand 4 states. [2019-11-20 01:00:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:31,541 INFO L93 Difference]: Finished difference Result 9618 states and 9901 transitions. [2019-11-20 01:00:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:00:31,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1651 [2019-11-20 01:00:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:31,547 INFO L225 Difference]: With dead ends: 9618 [2019-11-20 01:00:31,548 INFO L226 Difference]: Without dead ends: 3742 [2019-11-20 01:00:31,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:00:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-20 01:00:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2019-11-20 01:00:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-20 01:00:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3816 transitions. [2019-11-20 01:00:31,612 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3816 transitions. Word has length 1651 [2019-11-20 01:00:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:31,613 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3816 transitions. [2019-11-20 01:00:31,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:00:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3816 transitions. [2019-11-20 01:00:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2019-11-20 01:00:31,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:31,640 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:31,641 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1222533483, now seen corresponding path program 1 times [2019-11-20 01:00:31,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:31,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601956933] [2019-11-20 01:00:31,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8470 backedges. 2593 proven. 0 refuted. 0 times theorem prover too weak. 5877 trivial. 0 not checked. [2019-11-20 01:00:35,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601956933] [2019-11-20 01:00:35,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:35,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:00:35,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440033503] [2019-11-20 01:00:35,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:00:35,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:00:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:00:35,503 INFO L87 Difference]: Start difference. First operand 3742 states and 3816 transitions. Second operand 7 states. [2019-11-20 01:00:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:36,285 INFO L93 Difference]: Finished difference Result 7556 states and 7706 transitions. [2019-11-20 01:00:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:00:36,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1669 [2019-11-20 01:00:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:36,290 INFO L225 Difference]: With dead ends: 7556 [2019-11-20 01:00:36,290 INFO L226 Difference]: Without dead ends: 3920 [2019-11-20 01:00:36,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:00:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-20 01:00:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-20 01:00:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-20 01:00:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3811 transitions. [2019-11-20 01:00:36,332 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3811 transitions. Word has length 1669 [2019-11-20 01:00:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:36,334 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3811 transitions. [2019-11-20 01:00:36,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:00:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3811 transitions. [2019-11-20 01:00:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1723 [2019-11-20 01:00:36,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:36,354 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:36,355 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1151917844, now seen corresponding path program 1 times [2019-11-20 01:00:36,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:36,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842668614] [2019-11-20 01:00:36,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9629 backedges. 1553 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2019-11-20 01:00:38,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842668614] [2019-11-20 01:00:38,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:38,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:00:38,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335987073] [2019-11-20 01:00:38,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:00:38,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:00:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:00:38,797 INFO L87 Difference]: Start difference. First operand 3742 states and 3811 transitions. Second operand 5 states. [2019-11-20 01:00:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:39,782 INFO L93 Difference]: Finished difference Result 5168 states and 5276 transitions. [2019-11-20 01:00:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:00:39,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1722 [2019-11-20 01:00:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:39,787 INFO L225 Difference]: With dead ends: 5168 [2019-11-20 01:00:39,787 INFO L226 Difference]: Without dead ends: 4988 [2019-11-20 01:00:39,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 01:00:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-20 01:00:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2019-11-20 01:00:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-20 01:00:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4545 transitions. [2019-11-20 01:00:39,837 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4545 transitions. Word has length 1722 [2019-11-20 01:00:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:39,838 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4545 transitions. [2019-11-20 01:00:39,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:00:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4545 transitions. [2019-11-20 01:00:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2019-11-20 01:00:39,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:39,859 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:39,859 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:39,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1097919814, now seen corresponding path program 1 times [2019-11-20 01:00:39,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:39,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640515836] [2019-11-20 01:00:39,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9684 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2019-11-20 01:00:42,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640515836] [2019-11-20 01:00:42,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:42,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:00:42,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552907234] [2019-11-20 01:00:42,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:00:42,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:00:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:00:42,226 INFO L87 Difference]: Start difference. First operand 4454 states and 4545 transitions. Second operand 3 states. [2019-11-20 01:00:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:42,727 INFO L93 Difference]: Finished difference Result 8906 states and 9088 transitions. [2019-11-20 01:00:42,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:00:42,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1727 [2019-11-20 01:00:42,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:42,732 INFO L225 Difference]: With dead ends: 8906 [2019-11-20 01:00:42,732 INFO L226 Difference]: Without dead ends: 4454 [2019-11-20 01:00:42,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:00:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-20 01:00:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2019-11-20 01:00:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-20 01:00:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4152 transitions. [2019-11-20 01:00:42,780 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4152 transitions. Word has length 1727 [2019-11-20 01:00:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:42,783 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4152 transitions. [2019-11-20 01:00:42,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:00:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4152 transitions. [2019-11-20 01:00:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2019-11-20 01:00:42,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:42,808 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:42,808 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1415086703, now seen corresponding path program 1 times [2019-11-20 01:00:42,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:42,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240591325] [2019-11-20 01:00:42,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9651 backedges. 6081 proven. 426 refuted. 0 times theorem prover too weak. 3144 trivial. 0 not checked. [2019-11-20 01:00:48,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240591325] [2019-11-20 01:00:48,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337429903] [2019-11-20 01:00:48,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:00:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:48,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 2086 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:00:48,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:00:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9651 backedges. 6507 proven. 0 refuted. 0 times theorem prover too weak. 3144 trivial. 0 not checked. [2019-11-20 01:00:53,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:00:53,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-20 01:00:53,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114749438] [2019-11-20 01:00:53,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:00:53,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:00:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:00:53,729 INFO L87 Difference]: Start difference. First operand 4098 states and 4152 transitions. Second operand 6 states. [2019-11-20 01:00:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:00:55,028 INFO L93 Difference]: Finished difference Result 7304 states and 7410 transitions. [2019-11-20 01:00:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:00:55,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1727 [2019-11-20 01:00:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:00:55,036 INFO L225 Difference]: With dead ends: 7304 [2019-11-20 01:00:55,036 INFO L226 Difference]: Without dead ends: 4276 [2019-11-20 01:00:55,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1733 GetRequests, 1724 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:00:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-20 01:00:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2019-11-20 01:00:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-20 01:00:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4334 transitions. [2019-11-20 01:00:55,082 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4334 transitions. Word has length 1727 [2019-11-20 01:00:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:00:55,084 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4334 transitions. [2019-11-20 01:00:55,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:00:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4334 transitions. [2019-11-20 01:00:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1893 [2019-11-20 01:00:55,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:00:55,108 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:00:55,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:00:55,310 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:00:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:00:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash 773480895, now seen corresponding path program 1 times [2019-11-20 01:00:55,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:00:55,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606153379] [2019-11-20 01:00:55,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:00:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:00:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11344 backedges. 3050 proven. 0 refuted. 0 times theorem prover too weak. 8294 trivial. 0 not checked. [2019-11-20 01:00:59,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606153379] [2019-11-20 01:00:59,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:00:59,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:00:59,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853074102] [2019-11-20 01:00:59,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:00:59,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:00:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:00:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:00:59,817 INFO L87 Difference]: Start difference. First operand 4276 states and 4334 transitions. Second operand 7 states. [2019-11-20 01:01:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:00,440 INFO L93 Difference]: Finished difference Result 7353 states and 7457 transitions. [2019-11-20 01:01:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:01:00,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1892 [2019-11-20 01:01:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:00,445 INFO L225 Difference]: With dead ends: 7353 [2019-11-20 01:01:00,445 INFO L226 Difference]: Without dead ends: 4098 [2019-11-20 01:01:00,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:01:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-20 01:01:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-11-20 01:01:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-20 01:01:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4149 transitions. [2019-11-20 01:01:00,488 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4149 transitions. Word has length 1892 [2019-11-20 01:01:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:00,490 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4149 transitions. [2019-11-20 01:01:00,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:01:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4149 transitions. [2019-11-20 01:01:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2025 [2019-11-20 01:01:00,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:00,517 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 01:01:00,517 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:01:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1727252823, now seen corresponding path program 1 times [2019-11-20 01:01:00,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:01:00,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701164537] [2019-11-20 01:01:00,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:01:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13033 backedges. 1789 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-20 01:01:03,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701164537] [2019-11-20 01:01:03,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:03,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:01:03,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948112785] [2019-11-20 01:01:03,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:01:03,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:01:03,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:01:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:01:03,610 INFO L87 Difference]: Start difference. First operand 4098 states and 4149 transitions. Second operand 5 states. [2019-11-20 01:01:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:04,370 INFO L93 Difference]: Finished difference Result 4098 states and 4149 transitions. [2019-11-20 01:01:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:01:04,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2024 [2019-11-20 01:01:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:04,373 INFO L225 Difference]: With dead ends: 4098 [2019-11-20 01:01:04,373 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:01:04,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 01:01:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:01:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:01:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:01:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:01:04,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2024 [2019-11-20 01:01:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:04,376 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:01:04,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:01:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:01:04,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:01:04,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:01:04,922 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 206 [2019-11-20 01:01:05,384 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 211 [2019-11-20 01:01:06,665 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 192 DAG size of output: 85 [2019-11-20 01:01:08,068 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 197 DAG size of output: 85 [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-20 01:01:08,072 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,073 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,074 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-20 01:01:08,075 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-20 01:01:08,076 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-20 01:01:08,077 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,078 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 01:01:08,079 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-20 01:01:08,080 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-20 01:01:08,081 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,082 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-20 01:01:08,083 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,084 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 01:01:08,085 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 01:01:08,086 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-20 01:01:08,086 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-20 01:01:08,086 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-20 01:01:08,086 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,086 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,086 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse8 (= 7 ~a15~0)) (.cse6 (= ~a21~0 6)) (.cse0 (< 11 ~a12~0)) (.cse4 (= 8 ~a21~0)) (.cse1 (<= ~a12~0 599999)) (.cse15 (= ~a15~0 8)) (.cse11 (= ~a21~0 9)) (.cse7 (= 10 ~a21~0)) (.cse3 (= 9 ~a15~0)) (.cse17 (<= ~a12~0 11)) (.cse12 (<= ~a15~0 8)) (.cse5 (<= ~a12~0 80)) (.cse18 (= ~a21~0 7)) (.cse2 (= ~a24~0 1)) (.cse10 (= ~a15~0 5)) (.cse13 (<= ~a12~0 586307)) (.cse16 (+ ~a12~0 43)) (.cse9 (<= ~a15~0 6))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3 .cse5) (and .cse6 .cse2 (= ~a15~0 6)) (and (not .cse7) .cse8 .cse2) (and .cse4 .cse9) (and .cse6 .cse2 .cse10) (and .cse9 .cse11) (and .cse8 .cse2 (<= (+ ~a12~0 49) 0)) (and .cse0 .cse8 .cse2) (and .cse0 (and .cse5 .cse2 .cse12 .cse11)) (and .cse5 .cse9 .cse7) (and .cse6 .cse0 (= 8 ~a15~0) .cse2 .cse13) (and .cse0 (exists ((v_~a12~0_435 Int)) (let ((.cse14 (+ v_~a12~0_435 366333))) (and (<= v_~a12~0_435 80) (< 11 v_~a12~0_435) (<= ~a12~0 (div .cse14 5)) (<= 0 .cse14)))) (and .cse4 .cse2 .cse12)) (and .cse1 .cse2 (and .cse15 .cse7)) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse2 (and .cse5 .cse15) (< 0 .cse16) .cse11) (and .cse2 .cse17 .cse7 .cse3) (and .cse17 (and (and .cse18 .cse12) .cse2)) (and .cse9 (and .cse5 .cse18)) (and .cse2 (= ~a21~0 10) .cse10 .cse13) (and (<= .cse16 0) .cse9))) [2019-11-20 01:01:08,086 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-20 01:01:08,087 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:01:08,088 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse8 (= 7 ~a15~0)) (.cse6 (= ~a21~0 6)) (.cse0 (< 11 ~a12~0)) (.cse4 (= 8 ~a21~0)) (.cse1 (<= ~a12~0 599999)) (.cse15 (= ~a15~0 8)) (.cse11 (= ~a21~0 9)) (.cse7 (= 10 ~a21~0)) (.cse3 (= 9 ~a15~0)) (.cse17 (<= ~a12~0 11)) (.cse12 (<= ~a15~0 8)) (.cse5 (<= ~a12~0 80)) (.cse18 (= ~a21~0 7)) (.cse2 (= ~a24~0 1)) (.cse10 (= ~a15~0 5)) (.cse13 (<= ~a12~0 586307)) (.cse16 (+ ~a12~0 43)) (.cse9 (<= ~a15~0 6))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3 .cse5) (and .cse6 .cse2 (= ~a15~0 6)) (and (not .cse7) .cse8 .cse2) (and .cse4 .cse9) (and .cse6 .cse2 .cse10) (and .cse9 .cse11) (and .cse8 .cse2 (<= (+ ~a12~0 49) 0)) (and .cse0 .cse8 .cse2) (and .cse0 (and .cse5 .cse2 .cse12 .cse11)) (and .cse5 .cse9 .cse7) (and .cse6 .cse0 (= 8 ~a15~0) .cse2 .cse13) (and .cse0 (exists ((v_~a12~0_435 Int)) (let ((.cse14 (+ v_~a12~0_435 366333))) (and (<= v_~a12~0_435 80) (< 11 v_~a12~0_435) (<= ~a12~0 (div .cse14 5)) (<= 0 .cse14)))) (and .cse4 .cse2 .cse12)) (and .cse1 .cse2 (and .cse15 .cse7)) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse2 (and .cse5 .cse15) (< 0 .cse16) .cse11) (and .cse2 .cse17 .cse7 .cse3) (and .cse17 (and (and .cse18 .cse12) .cse2)) (and .cse9 (and .cse5 .cse18)) (and .cse2 (= ~a21~0 10) .cse10 .cse13) (and (<= .cse16 0) .cse9))) [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-20 01:01:08,089 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 01:01:08,090 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 01:01:08,091 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 01:01:08,092 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 01:01:08,093 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-20 01:01:08,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:01:08 BoogieIcfgContainer [2019-11-20 01:01:08,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:01:08,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:01:08,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:01:08,138 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:01:08,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:59:35" (3/4) ... [2019-11-20 01:01:08,143 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:01:08,174 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:01:08,176 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:01:08,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((11 < a12 && a12 <= 599999) && a24 == 1) && 9 == a15) || (((8 == a21 && a24 == 1) && 9 == a15) && a12 <= 80)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((!(10 == a21) && 7 == a15) && a24 == 1)) || (8 == a21 && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 9)) || ((7 == a15 && a24 == 1) && a12 + 49 <= 0)) || ((11 < a12 && 7 == a15) && a24 == 1)) || (11 < a12 && ((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((a12 <= 80 && a15 <= 6) && 10 == a21)) || ((((a21 == 6 && 11 < a12) && 8 == a15) && a24 == 1) && a12 <= 586307)) || ((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && (8 == a21 && a24 == 1) && a15 <= 8)) || ((a12 <= 599999 && a24 == 1) && a15 == 8 && 10 == a21)) || ((((!(5 == input) && a24 == 1) && a12 <= 80 && a15 == 8) && 0 < a12 + 43) && a21 == 9)) || (((a24 == 1 && a12 <= 11) && 10 == a21) && 9 == a15)) || (a12 <= 11 && (a21 == 7 && a15 <= 8) && a24 == 1)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || (a12 + 43 <= 0 && a15 <= 6) [2019-11-20 01:01:08,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((11 < a12 && a12 <= 599999) && a24 == 1) && 9 == a15) || (((8 == a21 && a24 == 1) && 9 == a15) && a12 <= 80)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((!(10 == a21) && 7 == a15) && a24 == 1)) || (8 == a21 && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 9)) || ((7 == a15 && a24 == 1) && a12 + 49 <= 0)) || ((11 < a12 && 7 == a15) && a24 == 1)) || (11 < a12 && ((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((a12 <= 80 && a15 <= 6) && 10 == a21)) || ((((a21 == 6 && 11 < a12) && 8 == a15) && a24 == 1) && a12 <= 586307)) || ((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && (8 == a21 && a24 == 1) && a15 <= 8)) || ((a12 <= 599999 && a24 == 1) && a15 == 8 && 10 == a21)) || ((((!(5 == input) && a24 == 1) && a12 <= 80 && a15 == 8) && 0 < a12 + 43) && a21 == 9)) || (((a24 == 1 && a12 <= 11) && 10 == a21) && 9 == a15)) || (a12 <= 11 && (a21 == 7 && a15 <= 8) && a24 == 1)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || (a12 + 43 <= 0 && a15 <= 6) [2019-11-20 01:01:08,359 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6320f68b-1b7e-4bd3-acb7-c8e0a108508b/bin/uautomizer/witness.graphml [2019-11-20 01:01:08,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:01:08,361 INFO L168 Benchmark]: Toolchain (without parser) took 96229.19 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 939.3 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 409.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,361 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:08,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.12 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,363 INFO L168 Benchmark]: Boogie Preprocessor took 150.26 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,363 INFO L168 Benchmark]: RCFGBuilder took 2113.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.8 MB in the end (delta: 123.9 MB). Peak memory consumption was 123.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,363 INFO L168 Benchmark]: TraceAbstraction took 92646.38 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 956.8 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,364 INFO L168 Benchmark]: Witness Printer took 221.77 ms. Allocated memory is still 5.1 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:08,366 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 929.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.12 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 150.26 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2113.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.8 MB in the end (delta: 123.9 MB). Peak memory consumption was 123.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92646.38 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 956.8 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 221.77 ms. Allocated memory is still 5.1 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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: 880]: Loop Invariant [2019-11-20 01:01:08,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((11 < a12 && a12 <= 599999) && a24 == 1) && 9 == a15) || (((8 == a21 && a24 == 1) && 9 == a15) && a12 <= 80)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((!(10 == a21) && 7 == a15) && a24 == 1)) || (8 == a21 && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 9)) || ((7 == a15 && a24 == 1) && a12 + 49 <= 0)) || ((11 < a12 && 7 == a15) && a24 == 1)) || (11 < a12 && ((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((a12 <= 80 && a15 <= 6) && 10 == a21)) || ((((a21 == 6 && 11 < a12) && 8 == a15) && a24 == 1) && a12 <= 586307)) || ((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && (8 == a21 && a24 == 1) && a15 <= 8)) || ((a12 <= 599999 && a24 == 1) && a15 == 8 && 10 == a21)) || ((((!(5 == input) && a24 == 1) && a12 <= 80 && a15 == 8) && 0 < a12 + 43) && a21 == 9)) || (((a24 == 1 && a12 <= 11) && 10 == a21) && 9 == a15)) || (a12 <= 11 && (a21 == 7 && a15 <= 8) && a24 == 1)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || (a12 + 43 <= 0 && a15 <= 6) - InvariantResult [Line: 20]: Loop Invariant [2019-11-20 01:01:08,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-20 01:01:08,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((11 < a12 && a12 <= 599999) && a24 == 1) && 9 == a15) || (((8 == a21 && a24 == 1) && 9 == a15) && a12 <= 80)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((!(10 == a21) && 7 == a15) && a24 == 1)) || (8 == a21 && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 9)) || ((7 == a15 && a24 == 1) && a12 + 49 <= 0)) || ((11 < a12 && 7 == a15) && a24 == 1)) || (11 < a12 && ((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((a12 <= 80 && a15 <= 6) && 10 == a21)) || ((((a21 == 6 && 11 < a12) && 8 == a15) && a24 == 1) && a12 <= 586307)) || ((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && (8 == a21 && a24 == 1) && a15 <= 8)) || ((a12 <= 599999 && a24 == 1) && a15 == 8 && 10 == a21)) || ((((!(5 == input) && a24 == 1) && a12 <= 80 && a15 == 8) && 0 < a12 + 43) && a21 == 9)) || (((a24 == 1 && a12 <= 11) && 10 == a21) && 9 == a15)) || (a12 <= 11 && (a21 == 7 && a15 <= 8) && a24 == 1)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || (a12 + 43 <= 0 && a15 <= 6) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 92.4s, OverallIterations: 24, TraceHistogramMax: 17, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, HoareTripleCheckerStatistics: 1654 SDtfs, 5896 SDslu, 290 SDs, 0 SdLazy, 20695 SolverSat, 1922 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6179 GetRequests, 6065 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 6930 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 88 NumberOfFragments, 539 HoareAnnotationTreeSize, 3 FomulaSimplifications, 767423 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 41739 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 29783 NumberOfCodeBlocks, 29783 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 29751 ConstructedInterpolants, 257 QuantifiedInterpolants, 105987262 SizeOfPredicates, 18 NumberOfNonLiveVariables, 7502 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 121671/122556 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...