./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/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 22c18731806e96bfa852bca51e2e7f8af9799504 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:26:44,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:26:44,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:26:44,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:26:44,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:26:44,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:26:44,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:26:44,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:26:44,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:26:44,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:26:44,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:26:44,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:26:44,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:26:44,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:26:44,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:26:44,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:26:44,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:26:44,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:26:44,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:26:44,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:26:44,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:26:44,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:26:44,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:26:44,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:26:44,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:26:44,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:26:44,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:26:44,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:26:44,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:26:44,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:26:44,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:26:44,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:26:44,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:26:44,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:26:44,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:26:44,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:26:44,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:26:44,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:26:44,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:26:44,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:26:44,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:26:44,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:26:45,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:26:45,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:26:45,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:26:45,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:26:45,006 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:26:45,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:26:45,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:26:45,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:26:45,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:26:45,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:26:45,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:26:45,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:26:45,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:26:45,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:26:45,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:26:45,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:26:45,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:26:45,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:26:45,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:26:45,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:26:45,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:26:45,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:26:45,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:26:45,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:26:45,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:26:45,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:26:45,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:26:45,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:26:45,012 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_851656d3-0d39-4e6a-83ac-ae017831c327/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 -> 22c18731806e96bfa852bca51e2e7f8af9799504 [2019-11-15 20:26:45,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:26:45,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:26:45,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:26:45,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:26:45,056 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:26:45,057 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2019-11-15 20:26:45,113 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/data/a44ee6426/c2f95b7da46e43808ef5d1a5460ae723/FLAGde37f4c5a [2019-11-15 20:26:45,657 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:26:45,657 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2019-11-15 20:26:45,673 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/data/a44ee6426/c2f95b7da46e43808ef5d1a5460ae723/FLAGde37f4c5a [2019-11-15 20:26:45,927 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/data/a44ee6426/c2f95b7da46e43808ef5d1a5460ae723 [2019-11-15 20:26:45,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:26:45,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:26:45,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:26:45,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:26:45,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:26:45,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:26:45" (1/1) ... [2019-11-15 20:26:45,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c7636a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:45, skipping insertion in model container [2019-11-15 20:26:45,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:26:45" (1/1) ... [2019-11-15 20:26:45,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:26:46,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:26:46,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:26:46,577 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:26:46,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:26:46,759 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:26:46,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46 WrapperNode [2019-11-15 20:26:46,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:26:46,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:26:46,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:26:46,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:26:46,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:26:46,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:26:46,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:26:46,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:26:46,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:46,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:47,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... [2019-11-15 20:26:47,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:26:47,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:26:47,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:26:47,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:26:47,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:26:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:26:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:26:48,910 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:26:48,910 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:26:48,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:26:48 BoogieIcfgContainer [2019-11-15 20:26:48,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:26:48,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:26:48,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:26:48,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:26:48,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:26:45" (1/3) ... [2019-11-15 20:26:48,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5f69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:26:48, skipping insertion in model container [2019-11-15 20:26:48,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:46" (2/3) ... [2019-11-15 20:26:48,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5f69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:26:48, skipping insertion in model container [2019-11-15 20:26:48,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:26:48" (3/3) ... [2019-11-15 20:26:48,924 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label57.c [2019-11-15 20:26:48,933 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:26:48,941 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:26:48,951 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:26:48,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:26:48,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:26:48,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:26:48,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:26:48,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:26:48,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:26:48,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:26:48,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:26:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 20:26:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:26:49,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:26:49,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:49,032 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:26:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2019-11-15 20:26:49,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:49,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544996592] [2019-11-15 20:26:49,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:49,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:49,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:26:49,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544996592] [2019-11-15 20:26:49,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:26:49,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:26:49,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553429306] [2019-11-15 20:26:49,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:26:49,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:26:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:26:49,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:49,414 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 20:26:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:26:51,477 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-11-15 20:26:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:26:51,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-15 20:26:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:26:51,505 INFO L225 Difference]: With dead ends: 966 [2019-11-15 20:26:51,505 INFO L226 Difference]: Without dead ends: 616 [2019-11-15 20:26:51,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-15 20:26:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-11-15 20:26:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-15 20:26:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-15 20:26:51,587 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 46 [2019-11-15 20:26:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:26:51,588 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-15 20:26:51,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:26:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-15 20:26:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 20:26:51,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:26:51,595 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:51,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:26:51,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1553487167, now seen corresponding path program 1 times [2019-11-15 20:26:51,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:51,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732719399] [2019-11-15 20:26:51,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:51,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:51,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:26:51,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732719399] [2019-11-15 20:26:51,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:26:51,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:26:51,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664061772] [2019-11-15 20:26:51,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:26:51,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:26:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:26:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:51,757 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-11-15 20:26:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:26:53,216 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-11-15 20:26:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:26:53,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-15 20:26:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:26:53,236 INFO L225 Difference]: With dead ends: 2309 [2019-11-15 20:26:53,236 INFO L226 Difference]: Without dead ends: 1711 [2019-11-15 20:26:53,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-11-15 20:26:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1527. [2019-11-15 20:26:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-11-15 20:26:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2032 transitions. [2019-11-15 20:26:53,305 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2032 transitions. Word has length 117 [2019-11-15 20:26:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:26:53,306 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2032 transitions. [2019-11-15 20:26:53,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:26:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2032 transitions. [2019-11-15 20:26:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 20:26:53,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:26:53,311 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:53,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:26:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash 624671770, now seen corresponding path program 1 times [2019-11-15 20:26:53,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:53,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382423978] [2019-11-15 20:26:53,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:53,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:53,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:26:53,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382423978] [2019-11-15 20:26:53,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:26:53,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:26:53,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749871951] [2019-11-15 20:26:53,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:26:53,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:26:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:26:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:53,503 INFO L87 Difference]: Start difference. First operand 1527 states and 2032 transitions. Second operand 4 states. [2019-11-15 20:26:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:26:55,067 INFO L93 Difference]: Finished difference Result 5088 states and 6913 transitions. [2019-11-15 20:26:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:26:55,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-15 20:26:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:26:55,089 INFO L225 Difference]: With dead ends: 5088 [2019-11-15 20:26:55,089 INFO L226 Difference]: Without dead ends: 3563 [2019-11-15 20:26:55,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-11-15 20:26:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2447. [2019-11-15 20:26:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-15 20:26:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-11-15 20:26:55,164 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 130 [2019-11-15 20:26:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:26:55,165 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-11-15 20:26:55,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:26:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-11-15 20:26:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 20:26:55,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:26:55,175 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:55,175 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:26:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash 383208159, now seen corresponding path program 1 times [2019-11-15 20:26:55,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:55,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341222091] [2019-11-15 20:26:55,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:55,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:55,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:26:55,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341222091] [2019-11-15 20:26:55,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:26:55,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:26:55,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706892477] [2019-11-15 20:26:55,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:26:55,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:26:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:26:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:26:55,424 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 5 states. [2019-11-15 20:26:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:26:57,194 INFO L93 Difference]: Finished difference Result 8049 states and 10315 transitions. [2019-11-15 20:26:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:26:57,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-11-15 20:26:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:26:57,227 INFO L225 Difference]: With dead ends: 8049 [2019-11-15 20:26:57,227 INFO L226 Difference]: Without dead ends: 5788 [2019-11-15 20:26:57,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:26:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-11-15 20:26:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5787. [2019-11-15 20:26:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-11-15 20:26:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7107 transitions. [2019-11-15 20:26:57,361 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7107 transitions. Word has length 173 [2019-11-15 20:26:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:26:57,363 INFO L462 AbstractCegarLoop]: Abstraction has 5787 states and 7107 transitions. [2019-11-15 20:26:57,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:26:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7107 transitions. [2019-11-15 20:26:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-15 20:26:57,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:26:57,375 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:57,375 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:26:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1602503085, now seen corresponding path program 1 times [2019-11-15 20:26:57,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:57,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719823962] [2019-11-15 20:26:57,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:57,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:57,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 20:26:57,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719823962] [2019-11-15 20:26:57,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:26:57,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:26:57,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635705387] [2019-11-15 20:26:57,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:26:57,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:26:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:26:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:57,749 INFO L87 Difference]: Start difference. First operand 5787 states and 7107 transitions. Second operand 4 states. [2019-11-15 20:26:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:26:59,047 INFO L93 Difference]: Finished difference Result 13801 states and 17074 transitions. [2019-11-15 20:26:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:26:59,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-15 20:26:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:26:59,084 INFO L225 Difference]: With dead ends: 13801 [2019-11-15 20:26:59,084 INFO L226 Difference]: Without dead ends: 8200 [2019-11-15 20:26:59,091 INFO L600 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-15 20:26:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2019-11-15 20:26:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 7995. [2019-11-15 20:26:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7995 states. [2019-11-15 20:26:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 9579 transitions. [2019-11-15 20:26:59,229 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 9579 transitions. Word has length 309 [2019-11-15 20:26:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:26:59,230 INFO L462 AbstractCegarLoop]: Abstraction has 7995 states and 9579 transitions. [2019-11-15 20:26:59,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:26:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 9579 transitions. [2019-11-15 20:26:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 20:26:59,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:26:59,242 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:59,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:26:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash -606468400, now seen corresponding path program 1 times [2019-11-15 20:26:59,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:59,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344585677] [2019-11-15 20:26:59,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-15 20:26:59,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344585677] [2019-11-15 20:26:59,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:26:59,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:26:59,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397780833] [2019-11-15 20:26:59,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:26:59,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:26:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:26:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:26:59,578 INFO L87 Difference]: Start difference. First operand 7995 states and 9579 transitions. Second operand 4 states. [2019-11-15 20:27:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:00,947 INFO L93 Difference]: Finished difference Result 20621 states and 24840 transitions. [2019-11-15 20:27:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:27:00,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-11-15 20:27:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:00,999 INFO L225 Difference]: With dead ends: 20621 [2019-11-15 20:27:00,999 INFO L226 Difference]: Without dead ends: 12812 [2019-11-15 20:27:01,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:27:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-11-15 20:27:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 8539. [2019-11-15 20:27:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8539 states. [2019-11-15 20:27:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 10160 transitions. [2019-11-15 20:27:01,166 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 10160 transitions. Word has length 332 [2019-11-15 20:27:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:01,167 INFO L462 AbstractCegarLoop]: Abstraction has 8539 states and 10160 transitions. [2019-11-15 20:27:01,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:27:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 10160 transitions. [2019-11-15 20:27:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-15 20:27:01,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:27:01,182 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:01,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:27:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1478199095, now seen corresponding path program 1 times [2019-11-15 20:27:01,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637831051] [2019-11-15 20:27:01,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-15 20:27:01,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637831051] [2019-11-15 20:27:01,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:01,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:27:01,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179457086] [2019-11-15 20:27:01,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:27:01,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:27:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:27:01,463 INFO L87 Difference]: Start difference. First operand 8539 states and 10160 transitions. Second operand 3 states. [2019-11-15 20:27:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:02,707 INFO L93 Difference]: Finished difference Result 17255 states and 20563 transitions. [2019-11-15 20:27:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:27:02,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-11-15 20:27:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:02,724 INFO L225 Difference]: With dead ends: 17255 [2019-11-15 20:27:02,724 INFO L226 Difference]: Without dead ends: 9826 [2019-11-15 20:27:02,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:27:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-11-15 20:27:02,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 6874. [2019-11-15 20:27:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-11-15 20:27:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 8202 transitions. [2019-11-15 20:27:02,828 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 8202 transitions. Word has length 338 [2019-11-15 20:27:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:02,828 INFO L462 AbstractCegarLoop]: Abstraction has 6874 states and 8202 transitions. [2019-11-15 20:27:02,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:27:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 8202 transitions. [2019-11-15 20:27:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-15 20:27:02,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:27:02,840 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:27:02,840 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:27:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1497380334, now seen corresponding path program 1 times [2019-11-15 20:27:02,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:02,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994017426] [2019-11-15 20:27:02,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:03,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994017426] [2019-11-15 20:27:03,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:03,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:27:03,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381760933] [2019-11-15 20:27:03,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:27:03,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:03,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:27:03,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:27:03,134 INFO L87 Difference]: Start difference. First operand 6874 states and 8202 transitions. Second operand 5 states. [2019-11-15 20:27:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:05,451 INFO L93 Difference]: Finished difference Result 19096 states and 23065 transitions. [2019-11-15 20:27:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:27:05,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 351 [2019-11-15 20:27:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:05,475 INFO L225 Difference]: With dead ends: 19096 [2019-11-15 20:27:05,475 INFO L226 Difference]: Without dead ends: 12408 [2019-11-15 20:27:05,482 INFO L600 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-15 20:27:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12408 states. [2019-11-15 20:27:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12408 to 9998. [2019-11-15 20:27:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9998 states. [2019-11-15 20:27:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9998 states to 9998 states and 12013 transitions. [2019-11-15 20:27:05,620 INFO L78 Accepts]: Start accepts. Automaton has 9998 states and 12013 transitions. Word has length 351 [2019-11-15 20:27:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:05,621 INFO L462 AbstractCegarLoop]: Abstraction has 9998 states and 12013 transitions. [2019-11-15 20:27:05,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:27:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 9998 states and 12013 transitions. [2019-11-15 20:27:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-11-15 20:27:05,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:27:05,645 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:05,645 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:27:05,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:05,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1603876004, now seen corresponding path program 1 times [2019-11-15 20:27:05,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:05,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330336214] [2019-11-15 20:27:05,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 435 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 20:27:06,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330336214] [2019-11-15 20:27:06,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607221706] [2019-11-15 20:27:06,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:27:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:06,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:27:06,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 20:27:06,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:27:06,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:27:06,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527433912] [2019-11-15 20:27:06,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:27:06,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:27:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:27:06,731 INFO L87 Difference]: Start difference. First operand 9998 states and 12013 transitions. Second operand 4 states. [2019-11-15 20:27:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:08,228 INFO L93 Difference]: Finished difference Result 21462 states and 25948 transitions. [2019-11-15 20:27:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:27:08,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 456 [2019-11-15 20:27:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:08,242 INFO L225 Difference]: With dead ends: 21462 [2019-11-15 20:27:08,242 INFO L226 Difference]: Without dead ends: 9994 [2019-11-15 20:27:08,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:27:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9994 states. [2019-11-15 20:27:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9994 to 8334. [2019-11-15 20:27:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8334 states. [2019-11-15 20:27:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8334 states to 8334 states and 9404 transitions. [2019-11-15 20:27:08,398 INFO L78 Accepts]: Start accepts. Automaton has 8334 states and 9404 transitions. Word has length 456 [2019-11-15 20:27:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:08,399 INFO L462 AbstractCegarLoop]: Abstraction has 8334 states and 9404 transitions. [2019-11-15 20:27:08,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:27:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 8334 states and 9404 transitions. [2019-11-15 20:27:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-15 20:27:08,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:27:08,420 INFO L380 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:08,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:27:08,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:27:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash -734371707, now seen corresponding path program 1 times [2019-11-15 20:27:08,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:08,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942197381] [2019-11-15 20:27:08,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-15 20:27:09,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942197381] [2019-11-15 20:27:09,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:09,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:27:09,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894088142] [2019-11-15 20:27:09,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:27:09,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:27:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:27:09,164 INFO L87 Difference]: Start difference. First operand 8334 states and 9404 transitions. Second operand 4 states. [2019-11-15 20:27:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:10,552 INFO L93 Difference]: Finished difference Result 17602 states and 19905 transitions. [2019-11-15 20:27:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:27:10,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-11-15 20:27:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:10,567 INFO L225 Difference]: With dead ends: 17602 [2019-11-15 20:27:10,567 INFO L226 Difference]: Without dead ends: 9083 [2019-11-15 20:27:10,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:27:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2019-11-15 20:27:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 8700. [2019-11-15 20:27:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8700 states. [2019-11-15 20:27:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8700 states to 8700 states and 9703 transitions. [2019-11-15 20:27:10,688 INFO L78 Accepts]: Start accepts. Automaton has 8700 states and 9703 transitions. Word has length 505 [2019-11-15 20:27:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:10,688 INFO L462 AbstractCegarLoop]: Abstraction has 8700 states and 9703 transitions. [2019-11-15 20:27:10,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:27:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 8700 states and 9703 transitions. [2019-11-15 20:27:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-11-15 20:27:10,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:27:10,706 INFO L380 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, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:10,706 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:27:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1159225603, now seen corresponding path program 1 times [2019-11-15 20:27:10,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:10,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657547351] [2019-11-15 20:27:10,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 403 proven. 382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:11,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657547351] [2019-11-15 20:27:11,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357883452] [2019-11-15 20:27:11,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:27:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:11,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:27:11,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:27:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:27:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:27:12,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:27:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 453 proven. 236 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 20:27:13,348 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:27:13,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-11-15 20:27:13,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446552170] [2019-11-15 20:27:13,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:27:13,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:13,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:27:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:27:13,350 INFO L87 Difference]: Start difference. First operand 8700 states and 9703 transitions. Second operand 14 states. [2019-11-15 20:27:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:24,849 INFO L93 Difference]: Finished difference Result 27949 states and 31001 transitions. [2019-11-15 20:27:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-15 20:27:24,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 522 [2019-11-15 20:27:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:24,876 INFO L225 Difference]: With dead ends: 27949 [2019-11-15 20:27:24,876 INFO L226 Difference]: Without dead ends: 18135 [2019-11-15 20:27:24,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=563, Invalid=1599, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 20:27:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18135 states. [2019-11-15 20:27:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18135 to 9248. [2019-11-15 20:27:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2019-11-15 20:27:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 10126 transitions. [2019-11-15 20:27:25,036 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 10126 transitions. Word has length 522 [2019-11-15 20:27:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:25,036 INFO L462 AbstractCegarLoop]: Abstraction has 9248 states and 10126 transitions. [2019-11-15 20:27:25,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:27:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 10126 transitions. [2019-11-15 20:27:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-11-15 20:27:25,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:27:25,058 INFO L380 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, 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, 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, 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] [2019-11-15 20:27:25,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:27:25,269 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:27:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1524195677, now seen corresponding path program 1 times [2019-11-15 20:27:25,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:25,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468238524] [2019-11-15 20:27:25,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:25,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:25,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-11-15 20:27:25,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468238524] [2019-11-15 20:27:25,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:25,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:27:25,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253998818] [2019-11-15 20:27:25,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:27:25,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:25,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:27:25,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:27:25,803 INFO L87 Difference]: Start difference. First operand 9248 states and 10126 transitions. Second operand 3 states. [2019-11-15 20:27:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:26,526 INFO L93 Difference]: Finished difference Result 18859 states and 20602 transitions. [2019-11-15 20:27:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:27:26,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-11-15 20:27:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:27:26,527 INFO L225 Difference]: With dead ends: 18859 [2019-11-15 20:27:26,527 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:27:26,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:27:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:27:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:27:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:27:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:27:26,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 685 [2019-11-15 20:27:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:27:26,533 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:26,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:27:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:27:26,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:27:26,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:27:27,109 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 309 [2019-11-15 20:27:27,651 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 309 [2019-11-15 20:27:30,135 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 297 DAG size of output: 114 [2019-11-15 20:27:32,351 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 297 DAG size of output: 114 [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,353 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 20:27:32,354 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse22 (= 12 ~a25~0))) (let ((.cse10 (= ~a25~0 13)) (.cse23 (<= ~a4~0 0)) (.cse9 (= 10 ~a25~0)) (.cse25 (<= ~a29~0 140)) (.cse14 (< 306 ~a23~0)) (.cse5 (<= ~a23~0 138)) (.cse24 (<= ~a25~0 9)) (.cse18 (<= ~a29~0 277)) (.cse4 (= 1 ~a4~0)) (.cse3 (not .cse22)) (.cse21 (< 138 ~a23~0)) (.cse19 (<= 312 ~a23~0))) (let ((.cse2 (<= ~a29~0 245)) (.cse11 (let ((.cse28 (<= ~a23~0 312))) (or (and .cse3 .cse28 .cse21) (and .cse28 .cse19)))) (.cse8 (and .cse24 .cse18 .cse4)) (.cse12 (<= ~a29~0 599928)) (.cse13 (= ~a25~0 11)) (.cse7 (or .cse14 .cse5)) (.cse6 (<= (+ ~a29~0 92) 0)) (.cse15 (let ((.cse27 (and .cse9 .cse25))) (or (and .cse23 .cse27) (and .cse5 .cse27)))) (.cse16 (not .cse10)) (.cse20 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse0 (= 1 ~a3~0)) (.cse1 (= 15 ~a8~0)) (.cse17 (<= (+ ~a23~0 43) 0)) (.cse26 (not (= ~a4~0 1)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4)) (and .cse5 .cse6) (and .cse7 .cse2 .cse8) (and .cse9 .cse2 .cse4) (and .cse10 (<= ~a23~0 306) .cse11 .cse2 .cse4) (and .cse12 .cse0 .cse1 .cse4 .cse13) (and .cse12 (<= 13 ~a25~0) .cse0 .cse14 .cse1 .cse4) (and .cse10 .cse12 .cse0 .cse11 .cse1 .cse4) (and .cse15 .cse7) (and .cse3 .cse12 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse4 .cse14) (and (or .cse3 .cse19) .cse6 .cse7 .cse4) (and (<= ~a29~0 220) .cse8) (and .cse14 .cse20 .cse0 .cse1 .cse4 .cse13) (and .cse12 .cse5 .cse13) (and (<= ~a29~0 599998) .cse5 .cse4 .cse13) (and .cse5 .cse9 .cse4) (and .cse0 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= (+ ~a29~0 299881) (mod v_~a29~0_500 299861)) (<= 0 v_~a29~0_500))) .cse1 .cse4 .cse21) (and .cse20 .cse0 .cse7 .cse9 .cse1 .cse4) (and .cse6 .cse15) (and .cse22 .cse23 .cse18) (and .cse24 .cse5 .cse4) (or (and .cse3 (<= (+ ~a29~0 22) 0) .cse5) (and .cse25 .cse16 .cse5 .cse26)) (and .cse20 .cse0 .cse24 .cse1 .cse4) (and .cse3 .cse18 .cse17) (and (and .cse22 .cse5 .cse26) .cse18))))) [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 20:27:32,355 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,356 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 20:27:32,357 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,358 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 144) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,359 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 20:27:32,360 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,361 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 20:27:32,362 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 20:27:32,363 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,363 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,363 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,363 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,364 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 20:27:32,365 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,366 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 20:27:32,367 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,368 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,369 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,370 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,371 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 20:27:32,372 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,373 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,374 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 20:27:32,375 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,376 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,377 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,378 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,379 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,380 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 20:27:32,381 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 20:27:32,381 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 20:27:32,381 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,381 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,381 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse22 (= 12 ~a25~0))) (let ((.cse10 (= ~a25~0 13)) (.cse23 (<= ~a4~0 0)) (.cse9 (= 10 ~a25~0)) (.cse25 (<= ~a29~0 140)) (.cse14 (< 306 ~a23~0)) (.cse5 (<= ~a23~0 138)) (.cse24 (<= ~a25~0 9)) (.cse18 (<= ~a29~0 277)) (.cse4 (= 1 ~a4~0)) (.cse3 (not .cse22)) (.cse21 (< 138 ~a23~0)) (.cse19 (<= 312 ~a23~0))) (let ((.cse2 (<= ~a29~0 245)) (.cse11 (let ((.cse28 (<= ~a23~0 312))) (or (and .cse3 .cse28 .cse21) (and .cse28 .cse19)))) (.cse8 (and .cse24 .cse18 .cse4)) (.cse12 (<= ~a29~0 599928)) (.cse13 (= ~a25~0 11)) (.cse7 (or .cse14 .cse5)) (.cse6 (<= (+ ~a29~0 92) 0)) (.cse15 (let ((.cse27 (and .cse9 .cse25))) (or (and .cse23 .cse27) (and .cse5 .cse27)))) (.cse16 (not .cse10)) (.cse20 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse0 (= 1 ~a3~0)) (.cse1 (= 15 ~a8~0)) (.cse17 (<= (+ ~a23~0 43) 0)) (.cse26 (not (= ~a4~0 1)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4)) (and .cse5 .cse6) (and .cse7 .cse2 .cse8) (and .cse9 .cse2 .cse4) (and .cse10 (<= ~a23~0 306) .cse11 .cse2 .cse4) (and .cse12 .cse0 .cse1 .cse4 .cse13) (and .cse12 (<= 13 ~a25~0) .cse0 .cse14 .cse1 .cse4) (and .cse10 .cse12 .cse0 .cse11 .cse1 .cse4) (and .cse15 .cse7) (and .cse3 .cse12 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse4 .cse14) (and (or .cse3 .cse19) .cse6 .cse7 .cse4) (and (<= ~a29~0 220) .cse8) (and .cse14 .cse20 .cse0 .cse1 .cse4 .cse13) (and .cse12 .cse5 .cse13) (and (<= ~a29~0 599998) .cse5 .cse4 .cse13) (and .cse5 .cse9 .cse4) (and .cse0 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= (+ ~a29~0 299881) (mod v_~a29~0_500 299861)) (<= 0 v_~a29~0_500))) .cse1 .cse4 .cse21) (and .cse20 .cse0 .cse7 .cse9 .cse1 .cse4) (and .cse6 .cse15) (and .cse22 .cse23 .cse18) (and .cse24 .cse5 .cse4) (or (and .cse3 (<= (+ ~a29~0 22) 0) .cse5) (and .cse25 .cse16 .cse5 .cse26)) (and .cse20 .cse0 .cse24 .cse1 .cse4) (and .cse3 .cse18 .cse17) (and (and .cse22 .cse5 .cse26) .cse18))))) [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,382 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:27:32,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:27:32 BoogieIcfgContainer [2019-11-15 20:27:32,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:27:32,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:27:32,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:27:32,431 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:27:32,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:26:48" (3/4) ... [2019-11-15 20:27:32,435 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:27:32,459 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:27:32,461 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:27:32,484 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) [2019-11-15 20:27:32,487 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) [2019-11-15 20:27:32,625 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_851656d3-0d39-4e6a-83ac-ae017831c327/bin/uautomizer/witness.graphml [2019-11-15 20:27:32,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:27:32,627 INFO L168 Benchmark]: Toolchain (without parser) took 46695.93 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 938.1 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,627 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:32,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,628 INFO L168 Benchmark]: Boogie Preprocessor took 133.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,628 INFO L168 Benchmark]: RCFGBuilder took 1880.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,629 INFO L168 Benchmark]: TraceAbstraction took 43517.40 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 891.2 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,629 INFO L168 Benchmark]: Witness Printer took 194.90 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:32,631 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 828.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1880.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43517.40 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 891.2 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 194.90 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 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_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 20:27:32,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 20:27:32,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 20:27:32,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 43.3s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, HoareTripleCheckerStatistics: 1638 SDtfs, 9025 SDslu, 768 SDs, 0 SdLazy, 23381 SolverSat, 3942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1093 GetRequests, 1021 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9998occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 22087 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 148 NumberOfFragments, 1049 HoareAnnotationTreeSize, 3 FomulaSimplifications, 11962 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 14418 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4942 NumberOfCodeBlocks, 4942 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4928 ConstructedInterpolants, 177 QuantifiedInterpolants, 8357007 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1253 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5417/6038 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...