./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label40.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/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 ff1c9a6c430c39da5b14cad9bf3eb91126a91c65 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:53:48,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:53:48,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:53:48,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:53:48,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:53:48,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:53:48,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:53:48,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:53:48,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:53:48,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:53:48,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:53:48,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:53:48,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:53:48,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:53:48,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:53:48,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:53:48,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:53:48,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:53:48,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:53:48,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:53:48,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:53:48,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:53:48,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:53:48,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:53:48,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:53:48,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:53:48,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:53:48,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:53:48,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:53:48,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:53:48,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:53:48,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:53:48,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:53:48,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:53:48,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:53:48,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:53:48,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:53:48,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:53:48,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:53:48,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:53:48,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:53:48,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:53:48,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:53:48,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:53:48,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:53:48,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:53:48,638 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:53:48,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:53:48,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:53:48,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:53:48,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:53:48,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:53:48,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:53:48,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:53:48,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:53:48,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:53:48,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:53:48,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:53:48,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:53:48,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:53:48,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:53:48,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:53:48,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:53:48,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:53:48,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:53:48,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:53:48,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:53:48,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:53:48,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:53:48,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:53:48,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/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 -> ff1c9a6c430c39da5b14cad9bf3eb91126a91c65 [2019-11-15 20:53:48,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:53:48,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:53:48,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:53:48,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:53:48,707 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:53:48,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label40.c [2019-11-15 20:53:48,782 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/data/ada380913/d5334b94674b46ffaae1b49ee0c8dd89/FLAG0369ed959 [2019-11-15 20:53:49,385 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:53:49,386 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/sv-benchmarks/c/eca-rers2012/Problem16_label40.c [2019-11-15 20:53:49,403 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/data/ada380913/d5334b94674b46ffaae1b49ee0c8dd89/FLAG0369ed959 [2019-11-15 20:53:49,592 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/data/ada380913/d5334b94674b46ffaae1b49ee0c8dd89 [2019-11-15 20:53:49,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:53:49,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:53:49,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:53:49,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:53:49,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:53:49,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:53:49" (1/1) ... [2019-11-15 20:53:49,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e84f4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:49, skipping insertion in model container [2019-11-15 20:53:49,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:53:49" (1/1) ... [2019-11-15 20:53:49,612 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:53:49,680 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:53:50,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:53:50,478 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:53:50,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:53:50,728 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:53:50,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50 WrapperNode [2019-11-15 20:53:50,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:53:50,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:53:50,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:53:50,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:53:50,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:50,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:50,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:53:50,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:53:50,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:53:50,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:53:50,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:50,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:50,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:50,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:51,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:51,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:51,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... [2019-11-15 20:53:51,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:53:51,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:53:51,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:53:51,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:53:51,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:53:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:53:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:53:53,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:53:53,907 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:53:53,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:53:53 BoogieIcfgContainer [2019-11-15 20:53:53,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:53:53,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:53:53,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:53:53,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:53:53,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:53:49" (1/3) ... [2019-11-15 20:53:53,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dd706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:53:53, skipping insertion in model container [2019-11-15 20:53:53,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:53:50" (2/3) ... [2019-11-15 20:53:53,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dd706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:53:53, skipping insertion in model container [2019-11-15 20:53:53,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:53:53" (3/3) ... [2019-11-15 20:53:53,917 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label40.c [2019-11-15 20:53:53,928 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:53:53,936 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:53:53,947 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:53:54,002 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:53:54,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:53:54,003 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:53:54,003 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:53:54,003 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:53:54,003 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:53:54,003 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:53:54,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:53:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-15 20:53:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:53:54,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:53:54,049 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] [2019-11-15 20:53:54,051 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:53:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:53:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2019-11-15 20:53:54,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:53:54,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694539216] [2019-11-15 20:53:54,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:53:54,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:53:54,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:53:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:53:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:53:54,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694539216] [2019-11-15 20:53:54,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:53:54,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:53:54,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209190649] [2019-11-15 20:53:54,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:53:54,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:53:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:53:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:53:54,446 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-11-15 20:53:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:53:58,389 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-11-15 20:53:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:53:58,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 20:53:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:53:58,416 INFO L225 Difference]: With dead ends: 1454 [2019-11-15 20:53:58,416 INFO L226 Difference]: Without dead ends: 991 [2019-11-15 20:53:58,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:53:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-15 20:53:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-15 20:53:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-15 20:53:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1549 transitions. [2019-11-15 20:53:58,533 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1549 transitions. Word has length 63 [2019-11-15 20:53:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:53:58,534 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1549 transitions. [2019-11-15 20:53:58,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:53:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1549 transitions. [2019-11-15 20:53:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 20:53:58,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:53:58,551 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:53:58,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:53:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:53:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1571044727, now seen corresponding path program 1 times [2019-11-15 20:53:58,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:53:58,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905473583] [2019-11-15 20:53:58,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:53:58,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:53:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:53:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:53:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-15 20:53:58,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905473583] [2019-11-15 20:53:58,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:53:58,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:53:58,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962556345] [2019-11-15 20:53:58,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:53:58,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:53:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:53:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:53:58,845 INFO L87 Difference]: Start difference. First operand 991 states and 1549 transitions. Second operand 4 states. [2019-11-15 20:54:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:01,799 INFO L93 Difference]: Finished difference Result 3625 states and 5594 transitions. [2019-11-15 20:54:01,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:01,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-15 20:54:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:01,814 INFO L225 Difference]: With dead ends: 3625 [2019-11-15 20:54:01,815 INFO L226 Difference]: Without dead ends: 2636 [2019-11-15 20:54:01,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-15 20:54:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2019-11-15 20:54:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-11-15 20:54:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3585 transitions. [2019-11-15 20:54:01,898 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3585 transitions. Word has length 223 [2019-11-15 20:54:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:01,900 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 3585 transitions. [2019-11-15 20:54:01,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3585 transitions. [2019-11-15 20:54:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-15 20:54:01,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:01,915 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:01,916 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash 339516116, now seen corresponding path program 1 times [2019-11-15 20:54:01,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:01,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079052135] [2019-11-15 20:54:01,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:01,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:01,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 20:54:02,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079052135] [2019-11-15 20:54:02,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:02,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:02,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580188475] [2019-11-15 20:54:02,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:54:02,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:02,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:02,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:02,330 INFO L87 Difference]: Start difference. First operand 2636 states and 3585 transitions. Second operand 3 states. [2019-11-15 20:54:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:04,287 INFO L93 Difference]: Finished difference Result 6915 states and 9643 transitions. [2019-11-15 20:54:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:04,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-11-15 20:54:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:04,312 INFO L225 Difference]: With dead ends: 6915 [2019-11-15 20:54:04,312 INFO L226 Difference]: Without dead ends: 4281 [2019-11-15 20:54:04,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2019-11-15 20:54:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2019-11-15 20:54:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-11-15 20:54:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5616 transitions. [2019-11-15 20:54:04,407 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5616 transitions. Word has length 317 [2019-11-15 20:54:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:04,408 INFO L462 AbstractCegarLoop]: Abstraction has 4281 states and 5616 transitions. [2019-11-15 20:54:04,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:54:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5616 transitions. [2019-11-15 20:54:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-11-15 20:54:04,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:04,422 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:04,423 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1345544856, now seen corresponding path program 1 times [2019-11-15 20:54:04,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:04,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743366722] [2019-11-15 20:54:04,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:04,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:04,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-15 20:54:04,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743366722] [2019-11-15 20:54:04,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:04,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:04,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889490549] [2019-11-15 20:54:04,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:54:04,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:04,758 INFO L87 Difference]: Start difference. First operand 4281 states and 5616 transitions. Second operand 3 states. [2019-11-15 20:54:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:06,824 INFO L93 Difference]: Finished difference Result 10534 states and 13972 transitions. [2019-11-15 20:54:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:06,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-11-15 20:54:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:06,853 INFO L225 Difference]: With dead ends: 10534 [2019-11-15 20:54:06,853 INFO L226 Difference]: Without dead ends: 5268 [2019-11-15 20:54:06,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2019-11-15 20:54:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2019-11-15 20:54:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-11-15 20:54:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5755 transitions. [2019-11-15 20:54:06,970 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5755 transitions. Word has length 480 [2019-11-15 20:54:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:06,971 INFO L462 AbstractCegarLoop]: Abstraction has 5268 states and 5755 transitions. [2019-11-15 20:54:06,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:54:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5755 transitions. [2019-11-15 20:54:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2019-11-15 20:54:06,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:06,994 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:06,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash -617653683, now seen corresponding path program 1 times [2019-11-15 20:54:06,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:06,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122275273] [2019-11-15 20:54:06,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:06,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:06,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-11-15 20:54:07,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122275273] [2019-11-15 20:54:07,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:07,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:07,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177465802] [2019-11-15 20:54:07,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:07,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:07,689 INFO L87 Difference]: Start difference. First operand 5268 states and 5755 transitions. Second operand 4 states. [2019-11-15 20:54:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:09,607 INFO L93 Difference]: Finished difference Result 17445 states and 19089 transitions. [2019-11-15 20:54:09,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:09,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 712 [2019-11-15 20:54:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:09,670 INFO L225 Difference]: With dead ends: 17445 [2019-11-15 20:54:09,670 INFO L226 Difference]: Without dead ends: 12179 [2019-11-15 20:54:09,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2019-11-15 20:54:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 9216. [2019-11-15 20:54:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9216 states. [2019-11-15 20:54:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 10049 transitions. [2019-11-15 20:54:09,904 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 10049 transitions. Word has length 712 [2019-11-15 20:54:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:09,904 INFO L462 AbstractCegarLoop]: Abstraction has 9216 states and 10049 transitions. [2019-11-15 20:54:09,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 10049 transitions. [2019-11-15 20:54:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-11-15 20:54:09,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:09,938 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:09,938 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2035612324, now seen corresponding path program 1 times [2019-11-15 20:54:09,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:09,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427817306] [2019-11-15 20:54:09,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:09,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:09,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-15 20:54:12,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427817306] [2019-11-15 20:54:12,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:12,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:54:12,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542510673] [2019-11-15 20:54:12,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:54:12,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:54:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:54:12,187 INFO L87 Difference]: Start difference. First operand 9216 states and 10049 transitions. Second operand 7 states. [2019-11-15 20:54:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:15,073 INFO L93 Difference]: Finished difference Result 18103 states and 19766 transitions. [2019-11-15 20:54:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:15,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 736 [2019-11-15 20:54:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:15,106 INFO L225 Difference]: With dead ends: 18103 [2019-11-15 20:54:15,107 INFO L226 Difference]: Without dead ends: 9218 [2019-11-15 20:54:15,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:54:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9218 states. [2019-11-15 20:54:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9218 to 9216. [2019-11-15 20:54:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9216 states. [2019-11-15 20:54:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 10048 transitions. [2019-11-15 20:54:15,237 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 10048 transitions. Word has length 736 [2019-11-15 20:54:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:15,238 INFO L462 AbstractCegarLoop]: Abstraction has 9216 states and 10048 transitions. [2019-11-15 20:54:15,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:54:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 10048 transitions. [2019-11-15 20:54:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2019-11-15 20:54:15,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:15,255 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:15,256 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 995908372, now seen corresponding path program 1 times [2019-11-15 20:54:15,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:15,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184662673] [2019-11-15 20:54:15,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:15,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:15,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 1166 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-15 20:54:16,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184662673] [2019-11-15 20:54:16,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:16,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:16,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067188155] [2019-11-15 20:54:16,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:16,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:16,236 INFO L87 Difference]: Start difference. First operand 9216 states and 10048 transitions. Second operand 4 states. [2019-11-15 20:54:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:17,876 INFO L93 Difference]: Finished difference Result 20733 states and 22574 transitions. [2019-11-15 20:54:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:17,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 851 [2019-11-15 20:54:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:17,916 INFO L225 Difference]: With dead ends: 20733 [2019-11-15 20:54:17,917 INFO L226 Difference]: Without dead ends: 11848 [2019-11-15 20:54:17,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-11-15 20:54:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10861. [2019-11-15 20:54:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-15 20:54:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11582 transitions. [2019-11-15 20:54:18,071 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11582 transitions. Word has length 851 [2019-11-15 20:54:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:18,072 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11582 transitions. [2019-11-15 20:54:18,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11582 transitions. [2019-11-15 20:54:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2019-11-15 20:54:18,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:18,093 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:18,093 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash -427974438, now seen corresponding path program 1 times [2019-11-15 20:54:18,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:18,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400013608] [2019-11-15 20:54:18,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 1138 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-11-15 20:54:18,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400013608] [2019-11-15 20:54:18,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:18,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:18,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235697711] [2019-11-15 20:54:18,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:18,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:18,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:18,967 INFO L87 Difference]: Start difference. First operand 10861 states and 11582 transitions. Second operand 4 states. [2019-11-15 20:54:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,623 INFO L93 Difference]: Finished difference Result 25010 states and 26712 transitions. [2019-11-15 20:54:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:20,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 914 [2019-11-15 20:54:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:20,649 INFO L225 Difference]: With dead ends: 25010 [2019-11-15 20:54:20,650 INFO L226 Difference]: Without dead ends: 14480 [2019-11-15 20:54:20,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2019-11-15 20:54:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 12835. [2019-11-15 20:54:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2019-11-15 20:54:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13505 transitions. [2019-11-15 20:54:20,817 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13505 transitions. Word has length 914 [2019-11-15 20:54:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:20,818 INFO L462 AbstractCegarLoop]: Abstraction has 12835 states and 13505 transitions. [2019-11-15 20:54:20,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13505 transitions. [2019-11-15 20:54:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1368 [2019-11-15 20:54:20,850 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:20,853 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,853 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash -418610693, now seen corresponding path program 1 times [2019-11-15 20:54:20,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399775140] [2019-11-15 20:54:20,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2019-11-15 20:54:22,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399775140] [2019-11-15 20:54:22,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:22,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:22,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703117710] [2019-11-15 20:54:22,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:22,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:22,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:22,590 INFO L87 Difference]: Start difference. First operand 12835 states and 13505 transitions. Second operand 4 states. [2019-11-15 20:54:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:24,054 INFO L93 Difference]: Finished difference Result 25668 states and 27019 transitions. [2019-11-15 20:54:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:24,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1367 [2019-11-15 20:54:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:24,077 INFO L225 Difference]: With dead ends: 25668 [2019-11-15 20:54:24,077 INFO L226 Difference]: Without dead ends: 13164 [2019-11-15 20:54:24,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-11-15 20:54:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 11848. [2019-11-15 20:54:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-11-15 20:54:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12278 transitions. [2019-11-15 20:54:24,229 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12278 transitions. Word has length 1367 [2019-11-15 20:54:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:24,231 INFO L462 AbstractCegarLoop]: Abstraction has 11848 states and 12278 transitions. [2019-11-15 20:54:24,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12278 transitions. [2019-11-15 20:54:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2019-11-15 20:54:24,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:24,268 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:24,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1864157073, now seen corresponding path program 1 times [2019-11-15 20:54:24,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:24,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639168867] [2019-11-15 20:54:24,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:24,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:24,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 3110 proven. 0 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2019-11-15 20:54:27,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639168867] [2019-11-15 20:54:27,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:27,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:54:27,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048844396] [2019-11-15 20:54:27,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:54:27,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:27,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:54:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:54:27,549 INFO L87 Difference]: Start difference. First operand 11848 states and 12278 transitions. Second operand 6 states. [2019-11-15 20:54:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:29,529 INFO L93 Difference]: Finished difference Result 24032 states and 24903 transitions. [2019-11-15 20:54:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:54:29,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1577 [2019-11-15 20:54:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:29,547 INFO L225 Difference]: With dead ends: 24032 [2019-11-15 20:54:29,548 INFO L226 Difference]: Without dead ends: 12515 [2019-11-15 20:54:29,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:54:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12515 states. [2019-11-15 20:54:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12515 to 12177. [2019-11-15 20:54:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-11-15 20:54:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12610 transitions. [2019-11-15 20:54:29,687 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12610 transitions. Word has length 1577 [2019-11-15 20:54:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:29,688 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 12610 transitions. [2019-11-15 20:54:29,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:54:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12610 transitions. [2019-11-15 20:54:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2019-11-15 20:54:29,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:29,725 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:29,726 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash -955905345, now seen corresponding path program 1 times [2019-11-15 20:54:29,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:29,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43700811] [2019-11-15 20:54:29,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4442 backedges. 2220 proven. 549 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2019-11-15 20:54:33,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43700811] [2019-11-15 20:54:33,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802332380] [2019-11-15 20:54:33,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:54:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:33,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1852 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:33,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4442 backedges. 2552 proven. 0 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2019-11-15 20:54:35,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:54:35,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 20:54:35,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66228931] [2019-11-15 20:54:35,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:54:35,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:35,762 INFO L87 Difference]: Start difference. First operand 12177 states and 12610 transitions. Second operand 3 states. [2019-11-15 20:54:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:37,363 INFO L93 Difference]: Finished difference Result 24023 states and 24887 transitions. [2019-11-15 20:54:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:37,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1619 [2019-11-15 20:54:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:37,385 INFO L225 Difference]: With dead ends: 24023 [2019-11-15 20:54:37,386 INFO L226 Difference]: Without dead ends: 12177 [2019-11-15 20:54:37,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1628 GetRequests, 1619 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-11-15 20:54:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2019-11-15 20:54:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-11-15 20:54:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12509 transitions. [2019-11-15 20:54:37,584 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12509 transitions. Word has length 1619 [2019-11-15 20:54:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:37,586 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 12509 transitions. [2019-11-15 20:54:37,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:54:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12509 transitions. [2019-11-15 20:54:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1789 [2019-11-15 20:54:37,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:37,625 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:37,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:54:37,831 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash -299278861, now seen corresponding path program 1 times [2019-11-15 20:54:37,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:37,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662660754] [2019-11-15 20:54:37,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:37,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:37,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6420 backedges. 4810 proven. 339 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2019-11-15 20:54:42,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662660754] [2019-11-15 20:54:42,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508407257] [2019-11-15 20:54:42,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:54:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:42,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:54:43,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6420 backedges. 2575 proven. 0 refuted. 0 times theorem prover too weak. 3845 trivial. 0 not checked. [2019-11-15 20:54:45,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:54:45,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-15 20:54:45,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470947247] [2019-11-15 20:54:45,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:54:45,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:45,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:45,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:45,742 INFO L87 Difference]: Start difference. First operand 12177 states and 12509 transitions. Second operand 3 states. [2019-11-15 20:54:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:46,713 INFO L93 Difference]: Finished difference Result 24681 states and 25360 transitions. [2019-11-15 20:54:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:46,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1788 [2019-11-15 20:54:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:46,736 INFO L225 Difference]: With dead ends: 24681 [2019-11-15 20:54:46,737 INFO L226 Difference]: Without dead ends: 12835 [2019-11-15 20:54:46,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1801 GetRequests, 1789 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2019-11-15 20:54:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12177. [2019-11-15 20:54:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-11-15 20:54:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12502 transitions. [2019-11-15 20:54:46,923 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12502 transitions. Word has length 1788 [2019-11-15 20:54:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:46,924 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 12502 transitions. [2019-11-15 20:54:46,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:54:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12502 transitions. [2019-11-15 20:54:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1819 [2019-11-15 20:54:46,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:46,957 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:47,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:54:47,163 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1110501745, now seen corresponding path program 1 times [2019-11-15 20:54:47,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:47,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747288528] [2019-11-15 20:54:47,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:47,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:47,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7270 backedges. 2578 proven. 157 refuted. 0 times theorem prover too weak. 4535 trivial. 0 not checked. [2019-11-15 20:54:51,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747288528] [2019-11-15 20:54:51,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573198025] [2019-11-15 20:54:51,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:54:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:51,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:51,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7270 backedges. 2735 proven. 0 refuted. 0 times theorem prover too weak. 4535 trivial. 0 not checked. [2019-11-15 20:54:53,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:54:53,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 20:54:53,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004860117] [2019-11-15 20:54:53,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:54:53,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:53,714 INFO L87 Difference]: Start difference. First operand 12177 states and 12502 transitions. Second operand 3 states. [2019-11-15 20:54:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:54,764 INFO L93 Difference]: Finished difference Result 25997 states and 26705 transitions. [2019-11-15 20:54:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:54,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1818 [2019-11-15 20:54:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:54,778 INFO L225 Difference]: With dead ends: 25997 [2019-11-15 20:54:54,778 INFO L226 Difference]: Without dead ends: 13822 [2019-11-15 20:54:54,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1826 GetRequests, 1817 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2019-11-15 20:54:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13822. [2019-11-15 20:54:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-15 20:54:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14168 transitions. [2019-11-15 20:54:54,943 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14168 transitions. Word has length 1818 [2019-11-15 20:54:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:54,944 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 14168 transitions. [2019-11-15 20:54:54,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:54:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14168 transitions. [2019-11-15 20:54:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1925 [2019-11-15 20:54:54,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:54,984 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:55,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:54:55,188 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:55,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1527906598, now seen corresponding path program 1 times [2019-11-15 20:54:55,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:55,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959722985] [2019-11-15 20:54:55,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:55,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:55,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:56,285 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 20:55:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7282 backedges. 3181 proven. 910 refuted. 0 times theorem prover too weak. 3191 trivial. 0 not checked. [2019-11-15 20:55:01,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959722985] [2019-11-15 20:55:01,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268325802] [2019-11-15 20:55:01,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:01,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 2237 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:55:01,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7282 backedges. 3944 proven. 0 refuted. 0 times theorem prover too weak. 3338 trivial. 0 not checked. [2019-11-15 20:55:03,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:55:03,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-15 20:55:03,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523403659] [2019-11-15 20:55:03,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:55:03,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:03,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:55:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:55:03,595 INFO L87 Difference]: Start difference. First operand 13822 states and 14168 transitions. Second operand 3 states. [2019-11-15 20:55:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:04,701 INFO L93 Difference]: Finished difference Result 28300 states and 29007 transitions. [2019-11-15 20:55:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:55:04,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1924 [2019-11-15 20:55:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:55:04,722 INFO L225 Difference]: With dead ends: 28300 [2019-11-15 20:55:04,722 INFO L226 Difference]: Without dead ends: 14480 [2019-11-15 20:55:04,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1942 GetRequests, 1925 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:55:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2019-11-15 20:55:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2019-11-15 20:55:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14480 states. [2019-11-15 20:55:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14830 transitions. [2019-11-15 20:55:04,889 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14830 transitions. Word has length 1924 [2019-11-15 20:55:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:55:04,890 INFO L462 AbstractCegarLoop]: Abstraction has 14480 states and 14830 transitions. [2019-11-15 20:55:04,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:55:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14830 transitions. [2019-11-15 20:55:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2138 [2019-11-15 20:55:04,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:55:04,934 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:05,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:05,139 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:55:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1034068003, now seen corresponding path program 1 times [2019-11-15 20:55:05,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:05,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576864703] [2019-11-15 20:55:05,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:05,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:05,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8394 backedges. 3559 proven. 910 refuted. 0 times theorem prover too weak. 3925 trivial. 0 not checked. [2019-11-15 20:55:11,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576864703] [2019-11-15 20:55:11,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314380392] [2019-11-15 20:55:11,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:12,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 2450 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:55:12,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:12,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:12,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8394 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 7724 trivial. 0 not checked. [2019-11-15 20:55:15,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:55:15,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-15 20:55:15,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139616738] [2019-11-15 20:55:15,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:55:15,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:15,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:55:15,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:55:15,102 INFO L87 Difference]: Start difference. First operand 14480 states and 14830 transitions. Second operand 3 states. [2019-11-15 20:55:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:20,170 INFO L93 Difference]: Finished difference Result 33891 states and 34715 transitions. [2019-11-15 20:55:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:55:20,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2137 [2019-11-15 20:55:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:55:20,172 INFO L225 Difference]: With dead ends: 33891 [2019-11-15 20:55:20,172 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:55:20,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2155 GetRequests, 2138 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:55:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:55:20,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:55:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:55:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:55:20,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2137 [2019-11-15 20:55:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:55:20,183 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:55:20,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:55:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:55:20,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:55:20,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:20,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:55:20,534 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 150 [2019-11-15 20:55:20,734 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 149 [2019-11-15 20:55:21,466 WARN L191 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 61 [2019-11-15 20:55:22,005 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 61 [2019-11-15 20:55:22,549 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 61 [2019-11-15 20:55:22,550 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,550 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,550 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,550 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,550 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 20:55:22,551 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L439 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse3 (= ~a12~0 6)) (.cse6 (not (= ~a12~0 5))) (.cse5 (= ~a16~0 8)) (.cse2 (= ~a12~0 8)) (.cse1 (not (= 10 ~a16~0))) (.cse0 (= 3 ~a15~0)) (.cse10 (exists ((v_~a18~0_900 Int)) (and (< 0 (+ v_~a18~0_900 156)) (<= 0 (+ (* 5 v_~a18~0_900) 1035)) (<= (+ (mod (+ (* v_~a18~0_900 5) 81) 106) 7) ~a18~0)))) (.cse8 (<= ~a16~0 11)) (.cse4 (<= 4 ~a15~0)) (.cse9 (= 5 ~a12~0)) (.cse7 (<= (+ ~a18~0 79) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse0 .cse3) (and .cse4 .cse3) (and .cse5 .cse6 .cse4) (and (and .cse1 .cse7) .cse6 .cse4) (and (= ~a15~0 4) .cse5) (and .cse4 .cse2 .cse1) (and (= ~a12~0 7) .cse4 .cse1) (and .cse8 .cse4 .cse9 .cse10) (and .cse9 .cse0 .cse10) (and .cse8 .cse4 (and .cse9 .cse7)))) [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 20:55:22,552 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,553 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,554 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L439 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse3 (= ~a12~0 6)) (.cse6 (not (= ~a12~0 5))) (.cse5 (= ~a16~0 8)) (.cse2 (= ~a12~0 8)) (.cse1 (not (= 10 ~a16~0))) (.cse0 (= 3 ~a15~0)) (.cse10 (exists ((v_~a18~0_900 Int)) (and (< 0 (+ v_~a18~0_900 156)) (<= 0 (+ (* 5 v_~a18~0_900) 1035)) (<= (+ (mod (+ (* v_~a18~0_900 5) 81) 106) 7) ~a18~0)))) (.cse8 (<= ~a16~0 11)) (.cse4 (<= 4 ~a15~0)) (.cse9 (= 5 ~a12~0)) (.cse7 (<= (+ ~a18~0 79) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse0 .cse3) (and .cse4 .cse3) (and .cse5 .cse6 .cse4) (and (and .cse1 .cse7) .cse6 .cse4) (and (= ~a15~0 4) .cse5) (and .cse4 .cse2 .cse1) (and (= ~a12~0 7) .cse4 .cse1) (and .cse8 .cse4 .cse9 .cse10) (and .cse9 .cse0 .cse10) (and .cse8 .cse4 (and .cse9 .cse7)))) [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,555 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L446 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,556 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,557 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 20:55:22,558 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse3 (= ~a12~0 6)) (.cse6 (not (= ~a12~0 5))) (.cse5 (= ~a16~0 8)) (.cse2 (= ~a12~0 8)) (.cse1 (not (= 10 ~a16~0))) (.cse0 (= 3 ~a15~0)) (.cse10 (exists ((v_~a18~0_900 Int)) (and (< 0 (+ v_~a18~0_900 156)) (<= 0 (+ (* 5 v_~a18~0_900) 1035)) (<= (+ (mod (+ (* v_~a18~0_900 5) 81) 106) 7) ~a18~0)))) (.cse8 (<= ~a16~0 11)) (.cse4 (<= 4 ~a15~0)) (.cse9 (= 5 ~a12~0)) (.cse7 (<= (+ ~a18~0 79) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse0 .cse3) (and .cse4 .cse3) (and .cse5 .cse6 .cse4) (and (and .cse1 .cse7) .cse6 .cse4) (and (= ~a15~0 4) .cse5) (and .cse4 .cse2 .cse1) (and (= ~a12~0 7) .cse4 .cse1) (and .cse8 .cse4 .cse9 .cse10) (and .cse9 .cse0 .cse10) (and .cse8 .cse4 (and .cse9 .cse7)))) [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:55:22,559 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,560 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 20:55:22,561 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,562 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,563 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,564 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,565 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 20:55:22,566 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,567 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,568 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,569 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 20:55:22,570 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,571 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 20:55:22,572 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,573 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,574 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 196) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,575 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,576 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 20:55:22,577 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,578 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-15 20:55:22,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:55:22 BoogieIcfgContainer [2019-11-15 20:55:22,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:55:22,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:55:22,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:55:22,614 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:55:22,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:53:53" (3/4) ... [2019-11-15 20:55:22,618 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:55:22,658 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 20:55:22,662 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:55:22,717 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((3 == a15 && !(10 == a16)) || (3 == a15 && a12 == 8)) || (3 == a15 && a12 == 6)) || (4 <= a15 && a12 == 6)) || ((a16 == 8 && !(a12 == 5)) && 4 <= a15)) || (((!(10 == a16) && a18 + 79 <= 0) && !(a12 == 5)) && 4 <= a15)) || (a15 == 4 && a16 == 8)) || ((4 <= a15 && a12 == 8) && !(10 == a16))) || ((a12 == 7 && 4 <= a15) && !(10 == a16))) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((5 == a12 && 3 == a15) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((a16 <= 11 && 4 <= a15) && 5 == a12 && a18 + 79 <= 0) [2019-11-15 20:55:22,720 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((3 == a15 && !(10 == a16)) || (3 == a15 && a12 == 8)) || (3 == a15 && a12 == 6)) || (4 <= a15 && a12 == 6)) || ((a16 == 8 && !(a12 == 5)) && 4 <= a15)) || (((!(10 == a16) && a18 + 79 <= 0) && !(a12 == 5)) && 4 <= a15)) || (a15 == 4 && a16 == 8)) || ((4 <= a15 && a12 == 8) && !(10 == a16))) || ((a12 == 7 && 4 <= a15) && !(10 == a16))) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((5 == a12 && 3 == a15) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((a16 <= 11 && 4 <= a15) && 5 == a12 && a18 + 79 <= 0) [2019-11-15 20:55:22,734 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((3 == a15 && !(10 == a16)) || (3 == a15 && a12 == 8)) || (3 == a15 && a12 == 6)) || (4 <= a15 && a12 == 6)) || ((a16 == 8 && !(a12 == 5)) && 4 <= a15)) || (((!(10 == a16) && a18 + 79 <= 0) && !(a12 == 5)) && 4 <= a15)) || (a15 == 4 && a16 == 8)) || ((4 <= a15 && a12 == 8) && !(10 == a16))) || ((a12 == 7 && 4 <= a15) && !(10 == a16))) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((5 == a12 && 3 == a15) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((a16 <= 11 && 4 <= a15) && 5 == a12 && a18 + 79 <= 0) [2019-11-15 20:55:22,928 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dcb27685-1b79-47fd-8376-80d3cb9f3459/bin/uautomizer/witness.graphml [2019-11-15 20:55:22,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:55:22,930 INFO L168 Benchmark]: Toolchain (without parser) took 93334.02 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 944.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,930 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:55:22,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1132.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 188.16 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,931 INFO L168 Benchmark]: Boogie Preprocessor took 167.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,932 INFO L168 Benchmark]: RCFGBuilder took 2822.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.1 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,932 INFO L168 Benchmark]: TraceAbstraction took 88703.00 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,933 INFO L168 Benchmark]: Witness Printer took 315.56 ms. Allocated memory is still 5.0 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:22,934 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1132.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 188.16 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 167.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2822.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.1 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88703.00 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 315.56 ms. Allocated memory is still 5.0 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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: 23]: Loop Invariant [2019-11-15 20:55:22,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: (((((((((((3 == a15 && !(10 == a16)) || (3 == a15 && a12 == 8)) || (3 == a15 && a12 == 6)) || (4 <= a15 && a12 == 6)) || ((a16 == 8 && !(a12 == 5)) && 4 <= a15)) || (((!(10 == a16) && a18 + 79 <= 0) && !(a12 == 5)) && 4 <= a15)) || (a15 == 4 && a16 == 8)) || ((4 <= a15 && a12 == 8) && !(10 == a16))) || ((a12 == 7 && 4 <= a15) && !(10 == a16))) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((5 == a12 && 3 == a15) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((a16 <= 11 && 4 <= a15) && 5 == a12 && a18 + 79 <= 0) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-15 20:55:22,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: (((((((((((3 == a15 && !(10 == a16)) || (3 == a15 && a12 == 8)) || (3 == a15 && a12 == 6)) || (4 <= a15 && a12 == 6)) || ((a16 == 8 && !(a12 == 5)) && 4 <= a15)) || (((!(10 == a16) && a18 + 79 <= 0) && !(a12 == 5)) && 4 <= a15)) || (a15 == 4 && a16 == 8)) || ((4 <= a15 && a12 == 8) && !(10 == a16))) || ((a12 == 7 && 4 <= a15) && !(10 == a16))) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((5 == a12 && 3 == a15) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((a16 <= 11 && 4 <= a15) && 5 == a12 && a18 + 79 <= 0) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-15 20:55:22,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-15 20:55:22,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: (((((((((((3 == a15 && !(10 == a16)) || (3 == a15 && a12 == 8)) || (3 == a15 && a12 == 6)) || (4 <= a15 && a12 == 6)) || ((a16 == 8 && !(a12 == 5)) && 4 <= a15)) || (((!(10 == a16) && a18 + 79 <= 0) && !(a12 == 5)) && 4 <= a15)) || (a15 == 4 && a16 == 8)) || ((4 <= a15 && a12 == 8) && !(10 == a16))) || ((a12 == 7 && 4 <= a15) && !(10 == a16))) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((5 == a12 && 3 == a15) && (\exists v_~a18~0_900 : int :: (0 < v_~a18~0_900 + 156 && 0 <= 5 * v_~a18~0_900 + 1035) && (v_~a18~0_900 * 5 + 81) % 106 + 7 <= a18))) || ((a16 <= 11 && 4 <= a15) && 5 == a12 && a18 + 79 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 88.5s, OverallIterations: 15, TraceHistogramMax: 12, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 3297 SDtfs, 6716 SDslu, 146 SDs, 0 SdLazy, 19087 SolverSat, 2871 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9400 GetRequests, 9307 SyntacticMatches, 28 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14480occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 7909 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 193 NumberOfFragments, 514 HoareAnnotationTreeSize, 4 FomulaSimplifications, 6302 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 5222 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 25812 NumberOfCodeBlocks, 25812 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 25792 ConstructedInterpolants, 61 QuantifiedInterpolants, 123046321 SizeOfPredicates, 2 NumberOfNonLiveVariables, 10731 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 79457/82322 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...