./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6.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_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:44,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:44,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:44,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:44,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:44,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:44,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:44,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:44,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:44,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:44,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:44,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:44,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:44,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:44,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:44,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:44,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:44,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:44,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:44,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:44,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:44,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:44,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:44,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:44,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:44,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:44,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:44,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:44,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:44,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:44,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:44,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:44,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:44,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:44,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:44,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:44,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:44,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:44,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:44,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:44,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:44,871 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:44,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:44,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:44,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:44,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:44,888 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:44,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:44,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:44,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:44,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:44,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:44,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:44,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:44,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:44,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:44,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:44,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:44,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:44,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:44,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:44,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:44,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:44,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:44,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:44,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:44,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:44,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:44,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:44,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:44,894 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_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-10-22 09:01:44,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:44,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:44,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:44,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:44,941 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:44,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_6.c [2019-10-22 09:01:45,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/data/c10972bb6/680af5c6e9fc46b0a59a8642d4af5986/FLAG9975c8452 [2019-10-22 09:01:45,368 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:45,368 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/sv-benchmarks/c/locks/test_locks_6.c [2019-10-22 09:01:45,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/data/c10972bb6/680af5c6e9fc46b0a59a8642d4af5986/FLAG9975c8452 [2019-10-22 09:01:45,773 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/data/c10972bb6/680af5c6e9fc46b0a59a8642d4af5986 [2019-10-22 09:01:45,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:45,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:45,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:45,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:45,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:45,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ed3245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45, skipping insertion in model container [2019-10-22 09:01:45,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,790 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:45,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:45,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:45,926 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:46,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:46,013 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:46,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46 WrapperNode [2019-10-22 09:01:46,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:46,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:46,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:46,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:46,019 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:46" (1/1) ... [2019-10-22 09:01:46,024 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:46" (1/1) ... [2019-10-22 09:01:46,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:46,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:46,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:46,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:46,049 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:46" (1/1) ... [2019-10-22 09:01:46,049 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:46" (1/1) ... [2019-10-22 09:01:46,050 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:46" (1/1) ... [2019-10-22 09:01:46,050 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:46" (1/1) ... [2019-10-22 09:01:46,052 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:46" (1/1) ... [2019-10-22 09:01:46,057 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:46" (1/1) ... [2019-10-22 09:01:46,058 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:46" (1/1) ... [2019-10-22 09:01:46,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:46,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:46,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:46,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:46,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/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:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:46,323 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:46,324 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:01:46,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46 BoogieIcfgContainer [2019-10-22 09:01:46,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:46,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:46,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:46,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:46,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:45" (1/3) ... [2019-10-22 09:01:46,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bdfa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:46, skipping insertion in model container [2019-10-22 09:01:46,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (2/3) ... [2019-10-22 09:01:46,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bdfa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:46, skipping insertion in model container [2019-10-22 09:01:46,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46" (3/3) ... [2019-10-22 09:01:46,332 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-22 09:01:46,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:46,347 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:46,358 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:46,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:46,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:46,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:46,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:46,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:46,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:46,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:46,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-22 09:01:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:46,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,418 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2019-10-22 09:01:46,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132368696] [2019-10-22 09:01:46,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,615 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:46,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132368696] [2019-10-22 09:01:46,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452459835] [2019-10-22 09:01:46,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,633 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-22 09:01:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,679 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-10-22 09:01:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 09:01:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,690 INFO L225 Difference]: With dead ends: 58 [2019-10-22 09:01:46,690 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 09:01:46,693 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:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 09:01:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-10-22 09:01:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:01:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-10-22 09:01:46,721 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2019-10-22 09:01:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,721 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-10-22 09:01:46,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-10-22 09:01:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:46,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,722 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2019-10-22 09:01:46,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474384669] [2019-10-22 09:01:46,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,760 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:46,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474384669] [2019-10-22 09:01:46,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844833945] [2019-10-22 09:01:46,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,764 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-10-22 09:01:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,790 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2019-10-22 09:01:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 09:01:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,792 INFO L225 Difference]: With dead ends: 73 [2019-10-22 09:01:46,792 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 09:01:46,793 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:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 09:01:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-22 09:01:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 09:01:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-10-22 09:01:46,801 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2019-10-22 09:01:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,801 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-10-22 09:01:46,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-10-22 09:01:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:46,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,802 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,802 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2019-10-22 09:01:46,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423872933] [2019-10-22 09:01:46,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,853 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:46,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423872933] [2019-10-22 09:01:46,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655054849] [2019-10-22 09:01:46,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,855 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-10-22 09:01:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,869 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-10-22 09:01:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:01:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,871 INFO L225 Difference]: With dead ends: 68 [2019-10-22 09:01:46,871 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 09:01:46,871 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:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 09:01:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-10-22 09:01:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 09:01:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2019-10-22 09:01:46,877 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2019-10-22 09:01:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,877 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2019-10-22 09:01:46,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2019-10-22 09:01:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:46,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,878 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2019-10-22 09:01:46,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328490652] [2019-10-22 09:01:46,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,902 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:46,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328490652] [2019-10-22 09:01:46,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841250102] [2019-10-22 09:01:46,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,904 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2019-10-22 09:01:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,918 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2019-10-22 09:01:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:01:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,920 INFO L225 Difference]: With dead ends: 84 [2019-10-22 09:01:46,920 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 09:01:46,920 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:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 09:01:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-10-22 09:01:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 09:01:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2019-10-22 09:01:46,927 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2019-10-22 09:01:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,927 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2019-10-22 09:01:46,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2019-10-22 09:01:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:01:46,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,928 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,928 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2019-10-22 09:01:46,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722656350] [2019-10-22 09:01:46,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,951 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:46,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722656350] [2019-10-22 09:01:46,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591413288] [2019-10-22 09:01:46,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,952 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2019-10-22 09:01:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,969 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2019-10-22 09:01:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:01:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,970 INFO L225 Difference]: With dead ends: 140 [2019-10-22 09:01:46,970 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 09:01:46,971 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:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 09:01:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-22 09:01:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 09:01:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2019-10-22 09:01:46,978 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2019-10-22 09:01:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,979 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2019-10-22 09:01:46,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2019-10-22 09:01:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:01:46,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2019-10-22 09:01:46,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934726958] [2019-10-22 09:01:46,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,013 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:47,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934726958] [2019-10-22 09:01:47,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080640653] [2019-10-22 09:01:47,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,015 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2019-10-22 09:01:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,047 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2019-10-22 09:01:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 09:01:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,048 INFO L225 Difference]: With dead ends: 125 [2019-10-22 09:01:47,048 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 09:01:47,049 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:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 09:01:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-10-22 09:01:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:01:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2019-10-22 09:01:47,054 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2019-10-22 09:01:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,055 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2019-10-22 09:01:47,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-10-22 09:01:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:01:47,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,056 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,056 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2019-10-22 09:01:47,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018670693] [2019-10-22 09:01:47,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,076 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:47,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018670693] [2019-10-22 09:01:47,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007614021] [2019-10-22 09:01:47,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,078 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2019-10-22 09:01:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,097 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2019-10-22 09:01:47,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 09:01:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,098 INFO L225 Difference]: With dead ends: 236 [2019-10-22 09:01:47,098 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 09:01:47,099 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:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 09:01:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-10-22 09:01:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 09:01:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2019-10-22 09:01:47,117 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2019-10-22 09:01:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,117 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2019-10-22 09:01:47,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2019-10-22 09:01:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:01:47,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,118 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,118 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2019-10-22 09:01:47,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753987019] [2019-10-22 09:01:47,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,137 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:47,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753987019] [2019-10-22 09:01:47,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831698840] [2019-10-22 09:01:47,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,139 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2019-10-22 09:01:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,152 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2019-10-22 09:01:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 09:01:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,153 INFO L225 Difference]: With dead ends: 192 [2019-10-22 09:01:47,154 INFO L226 Difference]: Without dead ends: 190 [2019-10-22 09:01:47,154 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:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-22 09:01:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2019-10-22 09:01:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 09:01:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-10-22 09:01:47,165 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2019-10-22 09:01:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,165 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-10-22 09:01:47,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-10-22 09:01:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:47,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,166 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:47,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2019-10-22 09:01:47,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284827172] [2019-10-22 09:01:47,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,208 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:47,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284827172] [2019-10-22 09:01:47,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591873033] [2019-10-22 09:01:47,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,210 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2019-10-22 09:01:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,237 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-10-22 09:01:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 09:01:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,240 INFO L225 Difference]: With dead ends: 276 [2019-10-22 09:01:47,240 INFO L226 Difference]: Without dead ends: 274 [2019-10-22 09:01:47,240 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:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-22 09:01:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2019-10-22 09:01:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-22 09:01:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2019-10-22 09:01:47,257 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2019-10-22 09:01:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,257 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2019-10-22 09:01:47,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2019-10-22 09:01:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:47,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,258 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:47,259 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2019-10-22 09:01:47,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563416848] [2019-10-22 09:01:47,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,293 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:47,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563416848] [2019-10-22 09:01:47,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390365558] [2019-10-22 09:01:47,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,295 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2019-10-22 09:01:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,324 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2019-10-22 09:01:47,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 09:01:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,325 INFO L225 Difference]: With dead ends: 516 [2019-10-22 09:01:47,325 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 09:01:47,326 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:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 09:01:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-10-22 09:01:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-22 09:01:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2019-10-22 09:01:47,338 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2019-10-22 09:01:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,338 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2019-10-22 09:01:47,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2019-10-22 09:01:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:01:47,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,340 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2019-10-22 09:01:47,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732682288] [2019-10-22 09:01:47,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,356 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:47,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732682288] [2019-10-22 09:01:47,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605921564] [2019-10-22 09:01:47,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,358 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2019-10-22 09:01:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,373 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2019-10-22 09:01:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 09:01:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,375 INFO L225 Difference]: With dead ends: 452 [2019-10-22 09:01:47,375 INFO L226 Difference]: Without dead ends: 310 [2019-10-22 09:01:47,376 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:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-22 09:01:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-10-22 09:01:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-22 09:01:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2019-10-22 09:01:47,393 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2019-10-22 09:01:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,393 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2019-10-22 09:01:47,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2019-10-22 09:01:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:01:47,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,395 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2019-10-22 09:01:47,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178729989] [2019-10-22 09:01:47,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,449 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:47,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178729989] [2019-10-22 09:01:47,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854456737] [2019-10-22 09:01:47,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,451 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2019-10-22 09:01:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,470 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2019-10-22 09:01:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 09:01:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,472 INFO L225 Difference]: With dead ends: 520 [2019-10-22 09:01:47,473 INFO L226 Difference]: Without dead ends: 518 [2019-10-22 09:01:47,473 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:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-22 09:01:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2019-10-22 09:01:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-22 09:01:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2019-10-22 09:01:47,487 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2019-10-22 09:01:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,487 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2019-10-22 09:01:47,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2019-10-22 09:01:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:01:47,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,489 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,489 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2019-10-22 09:01:47,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856309373] [2019-10-22 09:01:47,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,514 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:47,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856309373] [2019-10-22 09:01:47,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919889517] [2019-10-22 09:01:47,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,516 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2019-10-22 09:01:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,548 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2019-10-22 09:01:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 09:01:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,550 INFO L225 Difference]: With dead ends: 1016 [2019-10-22 09:01:47,551 INFO L226 Difference]: Without dead ends: 582 [2019-10-22 09:01:47,552 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:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-22 09:01:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-10-22 09:01:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 09:01:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2019-10-22 09:01:47,576 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2019-10-22 09:01:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,577 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2019-10-22 09:01:47,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2019-10-22 09:01:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:01:47,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,578 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2019-10-22 09:01:47,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421409213] [2019-10-22 09:01:47,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,605 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:47,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421409213] [2019-10-22 09:01:47,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95718307] [2019-10-22 09:01:47,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,607 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2019-10-22 09:01:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,633 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2019-10-22 09:01:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:01:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,636 INFO L225 Difference]: With dead ends: 872 [2019-10-22 09:01:47,636 INFO L226 Difference]: Without dead ends: 598 [2019-10-22 09:01:47,637 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:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-22 09:01:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-22 09:01:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-22 09:01:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2019-10-22 09:01:47,660 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2019-10-22 09:01:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,660 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2019-10-22 09:01:47,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2019-10-22 09:01:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:01:47,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,661 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,662 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2019-10-22 09:01:47,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889779937] [2019-10-22 09:01:47,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,693 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:47,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889779937] [2019-10-22 09:01:47,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16285834] [2019-10-22 09:01:47,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,695 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2019-10-22 09:01:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,731 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2019-10-22 09:01:47,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:01:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,735 INFO L225 Difference]: With dead ends: 966 [2019-10-22 09:01:47,735 INFO L226 Difference]: Without dead ends: 964 [2019-10-22 09:01:47,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:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-10-22 09:01:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2019-10-22 09:01:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-10-22 09:01:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2019-10-22 09:01:47,767 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2019-10-22 09:01:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,768 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2019-10-22 09:01:47,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2019-10-22 09:01:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:01:47,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,770 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2019-10-22 09:01:47,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790322947] [2019-10-22 09:01:47,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,803 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:47,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790322947] [2019-10-22 09:01:47,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427580674] [2019-10-22 09:01:47,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,805 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2019-10-22 09:01:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,839 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2019-10-22 09:01:47,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:01:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,840 INFO L225 Difference]: With dead ends: 1988 [2019-10-22 09:01:47,840 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:47,842 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:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:47,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-22 09:01:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,843 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:47,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:47,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:47,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:01:47,861 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-22 09:01:47,861 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,861 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:01:47,861 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:01:47,861 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,862 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-22 09:01:47,863 INFO L446 ceAbstractionStarter]: At program point L106(lines 4 107) the Hoare annotation is: true [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,863 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:01:47,864 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,864 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-22 09:01:47,864 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,864 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-22 09:01:47,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:47 BoogieIcfgContainer [2019-10-22 09:01:47,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:47,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:47,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:47,872 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:47,873 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:46" (3/4) ... [2019-10-22 09:01:47,876 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:47,887 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 09:01:47,887 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:47,951 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_87ee0ab8-c580-40fc-8e60-7f2f90589f3c/bin/uautomizer/witness.graphml [2019-10-22 09:01:47,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:47,953 INFO L168 Benchmark]: Toolchain (without parser) took 2175.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.5 MB in the beginning and 930.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:47,953 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:47,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:47,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:47,954 INFO L168 Benchmark]: Boogie Preprocessor took 18.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:47,955 INFO L168 Benchmark]: RCFGBuilder took 265.52 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:47,955 INFO L168 Benchmark]: TraceAbstraction took 1545.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.9 MB in the end (delta: 183.8 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:47,955 INFO L168 Benchmark]: Witness Printer took 79.56 ms. Allocated memory is still 1.2 GB. Free memory is still 930.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:47,957 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.52 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1545.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.9 MB in the end (delta: 183.8 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. * Witness Printer took 79.56 ms. Allocated memory is still 1.2 GB. Free memory is still 930.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 27]: 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, 27 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 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.3s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...