./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:52,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:52,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:52,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:52,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:52,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:52,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:52,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:52,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:52,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:52,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:52,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:52,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:52,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:52,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:52,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:52,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:52,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:52,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:52,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:52,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:52,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:52,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:52,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:52,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:52,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:52,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:52,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:52,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:52,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:52,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:52,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:52,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:52,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:52,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:52,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:52,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:52,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:52,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:52,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:52,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:52,818 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:52,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:52,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:52,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:52,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:52,832 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:52,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:52,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:52,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:52,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:52,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:52,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:52,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:52,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:52,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:52,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:52,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:52,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:52,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:52,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:52,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:52,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:52,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:52,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-10-22 09:01:52,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:52,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:52,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:52,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:52,875 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:52,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_5.c [2019-10-22 09:01:52,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/data/5d178581e/c1761ff1082247d18a3e7f0877e8881d/FLAG28c097b9d [2019-10-22 09:01:53,294 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:53,294 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/sv-benchmarks/c/locks/test_locks_5.c [2019-10-22 09:01:53,301 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/data/5d178581e/c1761ff1082247d18a3e7f0877e8881d/FLAG28c097b9d [2019-10-22 09:01:53,312 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/data/5d178581e/c1761ff1082247d18a3e7f0877e8881d [2019-10-22 09:01:53,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:53,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:53,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:53,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:53,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:53,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad92e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53, skipping insertion in model container [2019-10-22 09:01:53,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,331 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:53,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:53,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:53,545 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:53,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:53,576 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:53,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53 WrapperNode [2019-10-22 09:01:53,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:53,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:53,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:53,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:53,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:53,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:53,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:53,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:53,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... [2019-10-22 09:01:53,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:53,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:53,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:53,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:53,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:53,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:53,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:53,936 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:01:53,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:53 BoogieIcfgContainer [2019-10-22 09:01:53,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:53,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:53,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:53,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:53,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:53" (1/3) ... [2019-10-22 09:01:53,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59eb1147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:53, skipping insertion in model container [2019-10-22 09:01:53,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:53" (2/3) ... [2019-10-22 09:01:53,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59eb1147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:53, skipping insertion in model container [2019-10-22 09:01:53,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:53" (3/3) ... [2019-10-22 09:01:53,957 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-22 09:01:53,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:53,982 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:54,005 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:54,048 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:54,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:54,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:54,049 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:54,049 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:54,049 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:54,049 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:54,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-22 09:01:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:01:54,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,080 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-10-22 09:01:54,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577627053] [2019-10-22 09:01:54,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577627053] [2019-10-22 09:01:54,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540456907] [2019-10-22 09:01:54,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,248 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-22 09:01:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,290 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-10-22 09:01:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 09:01:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,303 INFO L225 Difference]: With dead ends: 52 [2019-10-22 09:01:54,304 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 09:01:54,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 09:01:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-10-22 09:01:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 09:01:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-10-22 09:01:54,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-10-22 09:01:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,347 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-10-22 09:01:54,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-10-22 09:01:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:01:54,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,348 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,348 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-10-22 09:01:54,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198285281] [2019-10-22 09:01:54,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198285281] [2019-10-22 09:01:54,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847604690] [2019-10-22 09:01:54,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,400 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-10-22 09:01:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,418 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-10-22 09:01:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 09:01:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,420 INFO L225 Difference]: With dead ends: 63 [2019-10-22 09:01:54,420 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 09:01:54,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 09:01:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-22 09:01:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 09:01:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-10-22 09:01:54,426 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-10-22 09:01:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,426 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-10-22 09:01:54,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-10-22 09:01:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:54,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,427 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-10-22 09:01:54,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916019056] [2019-10-22 09:01:54,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916019056] [2019-10-22 09:01:54,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408389081] [2019-10-22 09:01:54,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,458 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-10-22 09:01:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,475 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-10-22 09:01:54,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 09:01:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,476 INFO L225 Difference]: With dead ends: 59 [2019-10-22 09:01:54,476 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 09:01:54,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 09:01:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 09:01:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 09:01:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-10-22 09:01:54,482 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-10-22 09:01:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,482 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-10-22 09:01:54,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-10-22 09:01:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:54,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,483 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,484 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-10-22 09:01:54,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884115185] [2019-10-22 09:01:54,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884115185] [2019-10-22 09:01:54,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365625826] [2019-10-22 09:01:54,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,537 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-10-22 09:01:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,568 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-10-22 09:01:54,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 09:01:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,570 INFO L225 Difference]: With dead ends: 72 [2019-10-22 09:01:54,570 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 09:01:54,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 09:01:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-10-22 09:01:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 09:01:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-10-22 09:01:54,577 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-10-22 09:01:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,577 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-10-22 09:01:54,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-10-22 09:01:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:54,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,578 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-10-22 09:01:54,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654074213] [2019-10-22 09:01:54,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654074213] [2019-10-22 09:01:54,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115760503] [2019-10-22 09:01:54,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,616 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-10-22 09:01:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,632 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-10-22 09:01:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 09:01:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,634 INFO L225 Difference]: With dead ends: 120 [2019-10-22 09:01:54,634 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 09:01:54,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 09:01:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-22 09:01:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 09:01:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-10-22 09:01:54,641 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-10-22 09:01:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,642 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-10-22 09:01:54,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-10-22 09:01:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:54,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-10-22 09:01:54,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500485572] [2019-10-22 09:01:54,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500485572] [2019-10-22 09:01:54,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075052558] [2019-10-22 09:01:54,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,669 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-10-22 09:01:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,686 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-10-22 09:01:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:01:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,687 INFO L225 Difference]: With dead ends: 107 [2019-10-22 09:01:54,687 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 09:01:54,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 09:01:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-22 09:01:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 09:01:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-10-22 09:01:54,695 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-10-22 09:01:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,695 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-10-22 09:01:54,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-10-22 09:01:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:54,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,696 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-10-22 09:01:54,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142656173] [2019-10-22 09:01:54,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142656173] [2019-10-22 09:01:54,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127861865] [2019-10-22 09:01:54,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,718 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-10-22 09:01:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,734 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-10-22 09:01:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:01:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,736 INFO L225 Difference]: With dead ends: 200 [2019-10-22 09:01:54,736 INFO L226 Difference]: Without dead ends: 134 [2019-10-22 09:01:54,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-22 09:01:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-10-22 09:01:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 09:01:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-10-22 09:01:54,746 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-10-22 09:01:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,746 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-10-22 09:01:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-10-22 09:01:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:54,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,747 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-10-22 09:01:54,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536785956] [2019-10-22 09:01:54,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536785956] [2019-10-22 09:01:54,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208450133] [2019-10-22 09:01:54,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,781 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-10-22 09:01:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,796 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-10-22 09:01:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:01:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,798 INFO L225 Difference]: With dead ends: 160 [2019-10-22 09:01:54,798 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 09:01:54,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 09:01:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-10-22 09:01:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 09:01:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-10-22 09:01:54,809 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-10-22 09:01:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,810 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-10-22 09:01:54,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-10-22 09:01:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:01:54,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,811 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-10-22 09:01:54,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324464594] [2019-10-22 09:01:54,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324464594] [2019-10-22 09:01:54,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794714669] [2019-10-22 09:01:54,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,847 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-10-22 09:01:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,867 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-10-22 09:01:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 09:01:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,868 INFO L225 Difference]: With dead ends: 228 [2019-10-22 09:01:54,869 INFO L226 Difference]: Without dead ends: 226 [2019-10-22 09:01:54,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-22 09:01:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-10-22 09:01:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-22 09:01:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-10-22 09:01:54,897 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-10-22 09:01:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,897 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-10-22 09:01:54,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-10-22 09:01:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:01:54,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,899 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-10-22 09:01:54,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965240650] [2019-10-22 09:01:54,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:54,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965240650] [2019-10-22 09:01:54,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:54,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:54,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638775809] [2019-10-22 09:01:54,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:54,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,935 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-10-22 09:01:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,956 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-10-22 09:01:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:54,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 09:01:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:54,957 INFO L225 Difference]: With dead ends: 436 [2019-10-22 09:01:54,957 INFO L226 Difference]: Without dead ends: 250 [2019-10-22 09:01:54,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-22 09:01:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-22 09:01:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-22 09:01:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-10-22 09:01:54,973 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-10-22 09:01:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:54,974 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-10-22 09:01:54,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-10-22 09:01:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:54,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:54,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:54,975 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-10-22 09:01:54,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:54,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431320158] [2019-10-22 09:01:54,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:54,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:55,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431320158] [2019-10-22 09:01:55,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:55,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:55,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360385350] [2019-10-22 09:01:55,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:55,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:55,010 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-10-22 09:01:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:55,025 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-10-22 09:01:55,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:55,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 09:01:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:55,027 INFO L225 Difference]: With dead ends: 380 [2019-10-22 09:01:55,027 INFO L226 Difference]: Without dead ends: 262 [2019-10-22 09:01:55,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-22 09:01:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-22 09:01:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 09:01:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-10-22 09:01:55,039 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-10-22 09:01:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:55,039 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-10-22 09:01:55,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-10-22 09:01:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:55,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:55,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:55,041 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-10-22 09:01:55,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:55,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080556113] [2019-10-22 09:01:55,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:55,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:55,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:55,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080556113] [2019-10-22 09:01:55,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:55,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:55,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683055357] [2019-10-22 09:01:55,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:55,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:55,067 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-10-22 09:01:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:55,092 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-10-22 09:01:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:55,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 09:01:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:55,094 INFO L225 Difference]: With dead ends: 422 [2019-10-22 09:01:55,094 INFO L226 Difference]: Without dead ends: 420 [2019-10-22 09:01:55,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-10-22 09:01:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-10-22 09:01:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-22 09:01:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-10-22 09:01:55,112 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-10-22 09:01:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:55,112 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-10-22 09:01:55,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-10-22 09:01:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:55,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:55,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:55,116 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-10-22 09:01:55,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:55,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309135573] [2019-10-22 09:01:55,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:55,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:55,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:55,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309135573] [2019-10-22 09:01:55,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:55,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:55,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753492920] [2019-10-22 09:01:55,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:55,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:55,149 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-10-22 09:01:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:55,174 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-10-22 09:01:55,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:55,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 09:01:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:55,175 INFO L225 Difference]: With dead ends: 852 [2019-10-22 09:01:55,175 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:55,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:55,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-10-22 09:01:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:55,177 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:55,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:55,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:55,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:01:55,194 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-22 09:01:55,194 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,195 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,196 INFO L446 ceAbstractionStarter]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-10-22 09:01:55,196 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-22 09:01:55,197 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-22 09:01:55,197 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-22 09:01:55,197 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-22 09:01:55,197 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 09:01:55,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:55 BoogieIcfgContainer [2019-10-22 09:01:55,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:55,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:55,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:55,208 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:55,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:53" (3/4) ... [2019-10-22 09:01:55,212 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:55,223 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 09:01:55,223 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:55,267 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_90656b31-bf6a-4352-af3b-cfdf793c6868/bin/uautomizer/witness.graphml [2019-10-22 09:01:55,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:55,269 INFO L168 Benchmark]: Toolchain (without parser) took 1953.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.0 MB in the beginning and 998.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 87.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,269 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:55,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,270 INFO L168 Benchmark]: Boogie Preprocessor took 20.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,271 INFO L168 Benchmark]: RCFGBuilder took 307.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,271 INFO L168 Benchmark]: TraceAbstraction took 1268.98 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: 115.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,271 INFO L168 Benchmark]: Witness Printer took 59.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 998.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:55,273 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 307.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1268.98 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: 115.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 11.5 GB. * Witness Printer took 59.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 998.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 1.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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...