./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.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/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/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 eb8eeb6e67f290f9d56e698aa8c9c7a779115813 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:09,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:09,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:09,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:09,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:09,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:09,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:09,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:09,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:09,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:09,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:09,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:09,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:09,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:09,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:09,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:09,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:09,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:09,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:09,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:09,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:09,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:09,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:09,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:09,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:09,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:09,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:09,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:09,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:09,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:09,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:09,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:09,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:09,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:09,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:09,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:09,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:09,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:09,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:09,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:09,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:09,931 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:56:09,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:09,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:09,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:09,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:09,946 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:09,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:09,947 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:09,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:09,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:09,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:09,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:56:09,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:56:09,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:56:09,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:09,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:09,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:09,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:56:09,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:09,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:09,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:56:09,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:56:09,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:09,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:09,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:56:09,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:56:09,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:09,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:56:09,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:56:09,960 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/working_dir_2a936166-3174-456d-9659-5db65226e91c/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 -> eb8eeb6e67f290f9d56e698aa8c9c7a779115813 [2019-10-22 08:56:09,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:10,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:10,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:10,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:10,009 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:10,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-10-22 08:56:10,060 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/data/0a9bdbcea/9604be1c53f84e06ab2410d2c48dca7e/FLAG20b5768a7 [2019-10-22 08:56:10,567 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:10,568 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-10-22 08:56:10,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/data/0a9bdbcea/9604be1c53f84e06ab2410d2c48dca7e/FLAG20b5768a7 [2019-10-22 08:56:10,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/data/0a9bdbcea/9604be1c53f84e06ab2410d2c48dca7e [2019-10-22 08:56:10,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:10,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:10,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:10,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:10,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:10,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:10" (1/1) ... [2019-10-22 08:56:10,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a449db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:10, skipping insertion in model container [2019-10-22 08:56:10,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:10" (1/1) ... [2019-10-22 08:56:10,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:10,928 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:11,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:11,343 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:11,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:11,488 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:11,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11 WrapperNode [2019-10-22 08:56:11,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:11,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:11,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:11,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:11,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:11,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:11,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:11,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:11,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... [2019-10-22 08:56:11,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:11,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:11,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:11,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:11,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/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-10-22 08:56:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:12,596 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:12,596 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:56:12,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:12 BoogieIcfgContainer [2019-10-22 08:56:12,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:12,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:56:12,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:56:12,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:56:12,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:56:10" (1/3) ... [2019-10-22 08:56:12,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c5dfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:12, skipping insertion in model container [2019-10-22 08:56:12,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:11" (2/3) ... [2019-10-22 08:56:12,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c5dfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:12, skipping insertion in model container [2019-10-22 08:56:12,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:12" (3/3) ... [2019-10-22 08:56:12,607 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2019-10-22 08:56:12,616 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:56:12,624 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:56:12,634 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:56:12,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:56:12,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:56:12,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:56:12,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:12,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:12,660 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:56:12,660 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:12,660 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:56:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 08:56:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:56:12,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:12,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:12,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1128398527, now seen corresponding path program 1 times [2019-10-22 08:56:12,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:12,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317504561] [2019-10-22 08:56:12,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:13,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317504561] [2019-10-22 08:56:13,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:13,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:13,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38177835] [2019-10-22 08:56:13,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:13,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:13,172 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-22 08:56:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:14,385 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-10-22 08:56:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:14,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 08:56:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:14,404 INFO L225 Difference]: With dead ends: 687 [2019-10-22 08:56:14,404 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 08:56:14,407 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-10-22 08:56:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 08:56:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-10-22 08:56:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 08:56:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-10-22 08:56:14,459 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 100 [2019-10-22 08:56:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:14,459 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-10-22 08:56:14,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-10-22 08:56:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:56:14,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:14,464 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:14,464 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -365392174, now seen corresponding path program 1 times [2019-10-22 08:56:14,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386745024] [2019-10-22 08:56:14,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:14,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386745024] [2019-10-22 08:56:14,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:14,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:14,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917743290] [2019-10-22 08:56:14,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:14,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:14,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:14,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:14,540 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-10-22 08:56:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:15,179 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-10-22 08:56:15,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:15,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 08:56:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:15,183 INFO L225 Difference]: With dead ends: 1054 [2019-10-22 08:56:15,183 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 08:56:15,189 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-10-22 08:56:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 08:56:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-22 08:56:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 08:56:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-10-22 08:56:15,242 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 106 [2019-10-22 08:56:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:15,242 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-10-22 08:56:15,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-10-22 08:56:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-22 08:56:15,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:15,245 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -877508142, now seen corresponding path program 1 times [2019-10-22 08:56:15,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596938082] [2019-10-22 08:56:15,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:56:15,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596938082] [2019-10-22 08:56:15,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:15,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:15,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182096060] [2019-10-22 08:56:15,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:15,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:15,384 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 3 states. [2019-10-22 08:56:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:15,780 INFO L93 Difference]: Finished difference Result 2233 states and 3001 transitions. [2019-10-22 08:56:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:15,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-22 08:56:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:15,789 INFO L225 Difference]: With dead ends: 2233 [2019-10-22 08:56:15,789 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 08:56:15,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 08:56:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-10-22 08:56:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-22 08:56:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2019-10-22 08:56:15,827 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 107 [2019-10-22 08:56:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:15,827 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2019-10-22 08:56:15,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2019-10-22 08:56:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 08:56:15,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:15,831 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,833 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:15,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 873346348, now seen corresponding path program 1 times [2019-10-22 08:56:15,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966254650] [2019-10-22 08:56:15,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:56:15,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966254650] [2019-10-22 08:56:15,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:15,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:15,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726229549] [2019-10-22 08:56:15,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:15,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:15,893 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand 3 states. [2019-10-22 08:56:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:16,346 INFO L93 Difference]: Finished difference Result 2757 states and 3510 transitions. [2019-10-22 08:56:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:16,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-22 08:56:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:16,351 INFO L225 Difference]: With dead ends: 2757 [2019-10-22 08:56:16,351 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 08:56:16,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 08:56:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2019-10-22 08:56:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-10-22 08:56:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1658 transitions. [2019-10-22 08:56:16,385 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1658 transitions. Word has length 123 [2019-10-22 08:56:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:16,386 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1658 transitions. [2019-10-22 08:56:16,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1658 transitions. [2019-10-22 08:56:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-22 08:56:16,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:16,389 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:16,389 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash 5388463, now seen corresponding path program 1 times [2019-10-22 08:56:16,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391424877] [2019-10-22 08:56:16,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-22 08:56:16,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391424877] [2019-10-22 08:56:16,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:16,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:16,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60806632] [2019-10-22 08:56:16,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:16,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:16,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:16,448 INFO L87 Difference]: Start difference. First operand 1314 states and 1658 transitions. Second operand 3 states. [2019-10-22 08:56:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:16,862 INFO L93 Difference]: Finished difference Result 3281 states and 4119 transitions. [2019-10-22 08:56:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:16,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-22 08:56:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:16,869 INFO L225 Difference]: With dead ends: 3281 [2019-10-22 08:56:16,869 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 08:56:16,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 08:56:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-10-22 08:56:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 08:56:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1962 transitions. [2019-10-22 08:56:16,903 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1962 transitions. Word has length 134 [2019-10-22 08:56:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:16,903 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1962 transitions. [2019-10-22 08:56:16,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1962 transitions. [2019-10-22 08:56:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-22 08:56:16,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:16,907 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:16,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1459525699, now seen corresponding path program 1 times [2019-10-22 08:56:16,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628811066] [2019-10-22 08:56:16,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:56:16,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628811066] [2019-10-22 08:56:16,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:16,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:16,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762466719] [2019-10-22 08:56:16,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:16,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:16,980 INFO L87 Difference]: Start difference. First operand 1576 states and 1962 transitions. Second operand 4 states. [2019-10-22 08:56:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:17,466 INFO L93 Difference]: Finished difference Result 3286 states and 4070 transitions. [2019-10-22 08:56:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:17,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-22 08:56:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:17,471 INFO L225 Difference]: With dead ends: 3286 [2019-10-22 08:56:17,471 INFO L226 Difference]: Without dead ends: 1712 [2019-10-22 08:56:17,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-10-22 08:56:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1707. [2019-10-22 08:56:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 08:56:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-10-22 08:56:17,503 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 142 [2019-10-22 08:56:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:17,503 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-10-22 08:56:17,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-10-22 08:56:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-22 08:56:17,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:17,507 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:17,507 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash -822596485, now seen corresponding path program 1 times [2019-10-22 08:56:17,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:17,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408124258] [2019-10-22 08:56:17,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:17,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:17,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:56:17,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408124258] [2019-10-22 08:56:17,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:17,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:17,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738699595] [2019-10-22 08:56:17,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:17,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:17,574 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-10-22 08:56:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:18,437 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-10-22 08:56:18,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:18,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-22 08:56:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:18,443 INFO L225 Difference]: With dead ends: 3805 [2019-10-22 08:56:18,443 INFO L226 Difference]: Without dead ends: 2231 [2019-10-22 08:56:18,445 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-10-22 08:56:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-10-22 08:56:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-10-22 08:56:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-10-22 08:56:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-10-22 08:56:18,481 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 146 [2019-10-22 08:56:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:18,481 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-10-22 08:56:18,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-10-22 08:56:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-22 08:56:18,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:18,484 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:18,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2101585002, now seen corresponding path program 1 times [2019-10-22 08:56:18,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:18,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105838579] [2019-10-22 08:56:18,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:18,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:18,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:56:18,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105838579] [2019-10-22 08:56:18,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:18,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:18,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529858143] [2019-10-22 08:56:18,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:18,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:18,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:18,523 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-10-22 08:56:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:18,897 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-10-22 08:56:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:18,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-22 08:56:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:18,902 INFO L225 Difference]: With dead ends: 4067 [2019-10-22 08:56:18,903 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 08:56:18,905 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-10-22 08:56:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 08:56:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-10-22 08:56:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 08:56:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-10-22 08:56:18,937 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 149 [2019-10-22 08:56:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:18,937 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-10-22 08:56:18,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-10-22 08:56:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-22 08:56:18,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:18,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:18,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash -385356518, now seen corresponding path program 1 times [2019-10-22 08:56:18,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:18,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373944236] [2019-10-22 08:56:18,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:18,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:18,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:56:19,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373944236] [2019-10-22 08:56:19,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:19,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:19,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529697106] [2019-10-22 08:56:19,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:19,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:19,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:19,004 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-10-22 08:56:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:19,309 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-10-22 08:56:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:19,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-22 08:56:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:19,314 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 08:56:19,314 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 08:56:19,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 08:56:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-10-22 08:56:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 08:56:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-10-22 08:56:19,343 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 164 [2019-10-22 08:56:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:19,343 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-10-22 08:56:19,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-10-22 08:56:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-22 08:56:19,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:19,347 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:19,347 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1871280910, now seen corresponding path program 1 times [2019-10-22 08:56:19,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:19,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974055782] [2019-10-22 08:56:19,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-22 08:56:19,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974055782] [2019-10-22 08:56:19,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206129623] [2019-10-22 08:56:19,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/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-10-22 08:56:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:19,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:19,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 08:56:19,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:56:19,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-10-22 08:56:19,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875293082] [2019-10-22 08:56:19,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:19,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:19,708 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-10-22 08:56:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:20,070 INFO L93 Difference]: Finished difference Result 2757 states and 2995 transitions. [2019-10-22 08:56:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:20,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-22 08:56:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:20,078 INFO L225 Difference]: With dead ends: 2757 [2019-10-22 08:56:20,078 INFO L226 Difference]: Without dead ends: 2624 [2019-10-22 08:56:20,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-10-22 08:56:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2019-10-22 08:56:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-10-22 08:56:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2143 transitions. [2019-10-22 08:56:20,118 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2143 transitions. Word has length 193 [2019-10-22 08:56:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:20,118 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2143 transitions. [2019-10-22 08:56:20,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2143 transitions. [2019-10-22 08:56:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-22 08:56:20,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:20,122 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:20,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:20,323 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1923073630, now seen corresponding path program 1 times [2019-10-22 08:56:20,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:20,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529533504] [2019-10-22 08:56:20,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:20,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:20,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:56:20,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529533504] [2019-10-22 08:56:20,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817860390] [2019-10-22 08:56:20,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/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-10-22 08:56:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:20,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:20,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-22 08:56:20,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:56:20,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-10-22 08:56:20,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619335312] [2019-10-22 08:56:20,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:20,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:20,675 INFO L87 Difference]: Start difference. First operand 1969 states and 2143 transitions. Second operand 3 states. [2019-10-22 08:56:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:20,975 INFO L93 Difference]: Finished difference Result 1971 states and 2144 transitions. [2019-10-22 08:56:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:20,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-22 08:56:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:20,980 INFO L225 Difference]: With dead ends: 1971 [2019-10-22 08:56:20,980 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 08:56:20,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 08:56:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-10-22 08:56:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 08:56:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1989 transitions. [2019-10-22 08:56:21,010 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1989 transitions. Word has length 222 [2019-10-22 08:56:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:21,010 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1989 transitions. [2019-10-22 08:56:21,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1989 transitions. [2019-10-22 08:56:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-22 08:56:21,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:21,015 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:56:21,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:21,215 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,216 INFO L82 PathProgramCache]: Analyzing trace with hash -451722141, now seen corresponding path program 1 times [2019-10-22 08:56:21,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979334415] [2019-10-22 08:56:21,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:56:21,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979334415] [2019-10-22 08:56:21,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:21,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 08:56:21,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624172146] [2019-10-22 08:56:21,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 08:56:21,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:21,941 INFO L87 Difference]: Start difference. First operand 1838 states and 1989 transitions. Second operand 13 states. [2019-10-22 08:56:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:22,911 INFO L93 Difference]: Finished difference Result 4256 states and 4613 transitions. [2019-10-22 08:56:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:56:22,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-10-22 08:56:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:22,917 INFO L225 Difference]: With dead ends: 4256 [2019-10-22 08:56:22,917 INFO L226 Difference]: Without dead ends: 2420 [2019-10-22 08:56:22,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:56:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-10-22 08:56:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1896. [2019-10-22 08:56:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-22 08:56:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2050 transitions. [2019-10-22 08:56:22,950 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2050 transitions. Word has length 235 [2019-10-22 08:56:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:22,951 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2050 transitions. [2019-10-22 08:56:22,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 08:56:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2050 transitions. [2019-10-22 08:56:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-22 08:56:22,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:22,956 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:22,956 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 580910416, now seen corresponding path program 1 times [2019-10-22 08:56:22,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361477000] [2019-10-22 08:56:22,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-22 08:56:23,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361477000] [2019-10-22 08:56:23,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:23,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:23,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464257065] [2019-10-22 08:56:23,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:23,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:23,096 INFO L87 Difference]: Start difference. First operand 1896 states and 2050 transitions. Second operand 6 states. [2019-10-22 08:56:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:23,671 INFO L93 Difference]: Finished difference Result 4221 states and 4562 transitions. [2019-10-22 08:56:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:23,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-10-22 08:56:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:23,678 INFO L225 Difference]: With dead ends: 4221 [2019-10-22 08:56:23,678 INFO L226 Difference]: Without dead ends: 2327 [2019-10-22 08:56:23,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-10-22 08:56:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2027. [2019-10-22 08:56:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-10-22 08:56:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2180 transitions. [2019-10-22 08:56:23,712 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2180 transitions. Word has length 262 [2019-10-22 08:56:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:23,713 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 2180 transitions. [2019-10-22 08:56:23,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2180 transitions. [2019-10-22 08:56:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-22 08:56:23,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:23,718 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1] [2019-10-22 08:56:23,718 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1379127925, now seen corresponding path program 1 times [2019-10-22 08:56:23,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:23,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445169608] [2019-10-22 08:56:23,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:56:23,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445169608] [2019-10-22 08:56:23,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:23,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:23,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823997643] [2019-10-22 08:56:23,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:23,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:23,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:23,912 INFO L87 Difference]: Start difference. First operand 2027 states and 2180 transitions. Second operand 5 states. [2019-10-22 08:56:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:24,619 INFO L93 Difference]: Finished difference Result 4969 states and 5350 transitions. [2019-10-22 08:56:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:24,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-10-22 08:56:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:24,623 INFO L225 Difference]: With dead ends: 4969 [2019-10-22 08:56:24,623 INFO L226 Difference]: Without dead ends: 1896 [2019-10-22 08:56:24,625 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-10-22 08:56:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-10-22 08:56:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2019-10-22 08:56:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-22 08:56:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 1999 transitions. [2019-10-22 08:56:24,655 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 1999 transitions. Word has length 273 [2019-10-22 08:56:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:24,655 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 1999 transitions. [2019-10-22 08:56:24,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 1999 transitions. [2019-10-22 08:56:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-22 08:56:24,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:24,660 INFO L380 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:24,661 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash 990654567, now seen corresponding path program 1 times [2019-10-22 08:56:24,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:24,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950273218] [2019-10-22 08:56:24,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:24,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:24,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 08:56:24,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950273218] [2019-10-22 08:56:24,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:24,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:24,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713012872] [2019-10-22 08:56:24,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:24,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:24,810 INFO L87 Difference]: Start difference. First operand 1896 states and 1999 transitions. Second operand 4 states. [2019-10-22 08:56:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:25,141 INFO L93 Difference]: Finished difference Result 3788 states and 4007 transitions. [2019-10-22 08:56:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:25,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-10-22 08:56:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:25,142 INFO L225 Difference]: With dead ends: 3788 [2019-10-22 08:56:25,143 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:56:25,145 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-10-22 08:56:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:56:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:56:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:56:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:56:25,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-10-22 08:56:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:25,146 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:25,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:25,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:56:25,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:56:25,307 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 110 [2019-10-22 08:56:25,451 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 111 [2019-10-22 08:56:25,971 WARN L191 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2019-10-22 08:56:26,419 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 08:56:26,421 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,422 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 08:56:26,423 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 08:56:26,424 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 08:56:26,424 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 08:56:26,424 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,424 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,424 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 08:56:26,425 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 08:56:26,426 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse11 (= ~a20~0 1)) (.cse5 (= ~a21~0 1)) (.cse14 (= ~a16~0 6)) (.cse12 (= 15 ~a8~0))) (let ((.cse9 (<= ~a21~0 0)) (.cse7 (not .cse12)) (.cse0 (not (= ~a7~0 1))) (.cse4 (= ~a12~0 8)) (.cse6 (not .cse14)) (.cse2 (<= ~a17~0 0)) (.cse8 (= 1 ~a7~0)) (.cse13 (= 5 ~a16~0)) (.cse1 (and .cse11 .cse5)) (.cse10 (= ~a17~0 1)) (.cse3 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3 .cse4 .cse2 .cse5 (<= ~a20~0 0)) (and (and .cse0 .cse6 .cse5) .cse7) (and .cse8 .cse9 .cse6 .cse10) (and .cse8 .cse9 .cse11) (and .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse7) (and .cse8 (<= 15 ~a8~0) .cse5 .cse13) (and .cse2 .cse5 .cse13) (and .cse0 .cse4 .cse2 .cse5 .cse12 .cse14) (and .cse8 .cse6 .cse2 .cse5) (and .cse8 (or (and .cse5 .cse11 .cse13) (and .cse1 .cse10))) (and (and .cse10 (not .cse3)) .cse5 .cse11)))) [2019-10-22 08:56:26,426 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,426 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,426 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,426 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,426 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,426 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 08:56:26,427 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 08:56:26,428 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 08:56:26,428 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,428 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,428 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 08:56:26,429 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 08:56:26,430 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,431 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse11 (= ~a20~0 1)) (.cse5 (= ~a21~0 1)) (.cse14 (= ~a16~0 6)) (.cse12 (= 15 ~a8~0))) (let ((.cse9 (<= ~a21~0 0)) (.cse3 (= ~a16~0 4)) (.cse7 (not .cse12)) (.cse0 (not (= ~a7~0 1))) (.cse4 (= ~a12~0 8)) (.cse6 (not .cse14)) (.cse2 (<= ~a17~0 0)) (.cse8 (= 1 ~a7~0)) (.cse13 (= 5 ~a16~0)) (.cse1 (and .cse11 .cse5)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3 .cse4 .cse2 .cse5 (<= ~a20~0 0)) (and (and .cse0 .cse6 .cse5) .cse7) (and .cse8 .cse9 .cse6 .cse10) (and .cse8 .cse9 .cse11) (and (and .cse10 (not .cse3)) .cse5 .cse11) (and .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse7) (and .cse8 (<= 15 ~a8~0) .cse5 .cse13) (and .cse2 .cse5 .cse13) (and .cse0 .cse4 .cse2 .cse5 .cse12 .cse14) (and .cse8 .cse6 .cse2 .cse5) (and .cse8 (or (and .cse5 .cse11 .cse13) (and .cse1 .cse10)))))) [2019-10-22 08:56:26,431 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,432 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,432 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,432 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,432 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,433 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 08:56:26,434 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 08:56:26,435 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:56:26,436 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 08:56:26,436 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 08:56:26,436 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,437 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 08:56:26,438 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 08:56:26,439 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 08:56:26,440 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 08:56:26,440 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 08:56:26,440 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 08:56:26,440 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 08:56:26,441 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 08:56:26,441 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 08:56:26,441 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 08:56:26,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:26 BoogieIcfgContainer [2019-10-22 08:56:26,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:26,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:26,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:26,460 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:26,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:12" (3/4) ... [2019-10-22 08:56:26,463 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:56:26,478 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:56:26,479 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:56:26,580 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2a936166-3174-456d-9659-5db65226e91c/bin/uautomizer/witness.graphml [2019-10-22 08:56:26,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:26,581 INFO L168 Benchmark]: Toolchain (without parser) took 15711.33 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 579.9 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -405.8 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:26,581 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:26,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:26,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:26,582 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:26,582 INFO L168 Benchmark]: RCFGBuilder took 994.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 117.2 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:26,583 INFO L168 Benchmark]: TraceAbstraction took 13861.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 423.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -380.3 MB). Peak memory consumption was 590.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:26,583 INFO L168 Benchmark]: Witness Printer took 120.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:26,585 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 994.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 117.2 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13861.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 423.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -380.3 MB). Peak memory consumption was 590.2 MB. Max. memory is 11.5 GB. * Witness Printer took 120.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((!(a7 == 1) && a20 == 1 && a21 == 1) && a17 <= 0) || ((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(a7 == 1) && !(a16 == 6)) && a21 == 1) && !(15 == a8))) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || ((!(a7 == 1) && a20 == 1 && a21 == 1) && !(15 == a8))) || (((1 == a7 && 15 <= a8) && a21 == 1) && 5 == a16)) || ((a17 <= 0 && a21 == 1) && 5 == a16)) || (((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a16 == 6)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || (1 == a7 && (((a21 == 1 && a20 == 1) && 5 == a16) || ((a20 == 1 && a21 == 1) && a17 == 1)))) || (((a17 == 1 && !(a16 == 4)) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((!(a7 == 1) && a20 == 1 && a21 == 1) && a17 <= 0) || ((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(a7 == 1) && !(a16 == 6)) && a21 == 1) && !(15 == a8))) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || (((a17 == 1 && !(a16 == 4)) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || ((!(a7 == 1) && a20 == 1 && a21 == 1) && !(15 == a8))) || (((1 == a7 && 15 <= a8) && a21 == 1) && 5 == a16)) || ((a17 <= 0 && a21 == 1) && 5 == a16)) || (((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a16 == 6)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || (1 == a7 && (((a21 == 1 && a20 == 1) && 5 == a16) || ((a20 == 1 && a21 == 1) && a17 == 1))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.7s, OverallIterations: 15, TraceHistogramMax: 5, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 1123 SDtfs, 3017 SDslu, 162 SDs, 0 SdLazy, 7807 SolverSat, 1027 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 439 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2027occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 3056 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 447 HoareAnnotationTreeSize, 3 FomulaSimplifications, 52394 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3228 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3055 NumberOfCodeBlocks, 3055 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3038 ConstructedInterpolants, 0 QuantifiedInterpolants, 2137951 SizeOfPredicates, 2 NumberOfNonLiveVariables, 765 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 2445/2542 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...