./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12.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_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:37,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:37,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:37,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:37,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:37,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:37,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:37,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:37,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:37,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:37,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:37,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:37,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:37,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:37,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:37,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:37,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:37,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:37,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:37,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:37,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:37,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:37,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:37,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:37,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:37,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:37,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:37,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:37,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:37,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:37,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:37,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:37,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:37,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:37,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:37,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:37,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:37,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:37,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:37,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:37,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:37,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:37,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:37,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:37,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:37,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:37,891 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:37,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:37,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:37,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:37,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:37,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:37,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:37,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:37,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:37,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:37,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:37,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:37,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:37,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:37,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:37,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:37,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:37,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:37,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:37,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:37,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:37,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:37,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:37,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:37,895 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_b08c7542-148a-4b79-a136-9f5454c6108d/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2019-10-22 08:58:37,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:37,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:37,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:37,938 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:37,939 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:37,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2019-10-22 08:58:37,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/data/10c5d1331/72f5289d2f044284aa73759bfc651b36/FLAG56a8c2415 [2019-10-22 08:58:38,416 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:38,417 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/sv-benchmarks/c/locks/test_locks_12.c [2019-10-22 08:58:38,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/data/10c5d1331/72f5289d2f044284aa73759bfc651b36/FLAG56a8c2415 [2019-10-22 08:58:38,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/data/10c5d1331/72f5289d2f044284aa73759bfc651b36 [2019-10-22 08:58:38,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:38,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:38,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:38,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:38,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:38,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fda2e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38, skipping insertion in model container [2019-10-22 08:58:38,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,811 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:38,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:38,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:38,971 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:39,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:39,065 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:39,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39 WrapperNode [2019-10-22 08:58:39,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:39,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:39,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:39,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:39,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:39,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:39,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:39,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:39,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... [2019-10-22 08:58:39,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:39,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:39,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:39,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:39,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:39,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:39,476 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:39,476 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:58:39,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:39 BoogieIcfgContainer [2019-10-22 08:58:39,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:39,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:39,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:39,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:39,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:38" (1/3) ... [2019-10-22 08:58:39,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd526c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:39, skipping insertion in model container [2019-10-22 08:58:39,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:39" (2/3) ... [2019-10-22 08:58:39,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd526c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:39, skipping insertion in model container [2019-10-22 08:58:39,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:39" (3/3) ... [2019-10-22 08:58:39,484 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-10-22 08:58:39,490 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:39,495 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:58:39,505 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:58:39,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:39,524 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:39,524 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:39,524 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:39,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:39,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:39,525 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:39,525 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-10-22 08:58:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:58:39,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:39,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:39,545 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-10-22 08:58:39,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:39,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596218297] [2019-10-22 08:58:39,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:39,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596218297] [2019-10-22 08:58:39,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:39,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:39,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409533179] [2019-10-22 08:58:39,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:39,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:39,743 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-10-22 08:58:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:39,794 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-10-22 08:58:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:39,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:58:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:39,808 INFO L225 Difference]: With dead ends: 94 [2019-10-22 08:58:39,808 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 08:58:39,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 08:58:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-10-22 08:58:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 08:58:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-10-22 08:58:39,844 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-10-22 08:58:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:39,844 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-10-22 08:58:39,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-10-22 08:58:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:58:39,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:39,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:39,846 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-10-22 08:58:39,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:39,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090920969] [2019-10-22 08:58:39,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:39,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090920969] [2019-10-22 08:58:39,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:39,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:39,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643621793] [2019-10-22 08:58:39,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:39,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:39,908 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-10-22 08:58:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:39,944 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-10-22 08:58:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:39,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:58:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:39,948 INFO L225 Difference]: With dead ends: 133 [2019-10-22 08:58:39,948 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 08:58:39,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 08:58:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-10-22 08:58:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 08:58:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-10-22 08:58:39,957 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-10-22 08:58:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:39,958 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-10-22 08:58:39,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-10-22 08:58:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:58:39,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:39,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:39,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-10-22 08:58:39,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:39,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31628088] [2019-10-22 08:58:39,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:39,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31628088] [2019-10-22 08:58:39,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:39,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:39,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453027300] [2019-10-22 08:58:39,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:39,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:39,998 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-10-22 08:58:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,016 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-10-22 08:58:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:58:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,018 INFO L225 Difference]: With dead ends: 122 [2019-10-22 08:58:40,018 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:58:40,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:58:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-22 08:58:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 08:58:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-10-22 08:58:40,026 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-10-22 08:58:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,026 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-10-22 08:58:40,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-10-22 08:58:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:58:40,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,028 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-10-22 08:58:40,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937938256] [2019-10-22 08:58:40,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937938256] [2019-10-22 08:58:40,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199140385] [2019-10-22 08:58:40,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,081 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-10-22 08:58:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,112 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-10-22 08:58:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:58:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,116 INFO L225 Difference]: With dead ends: 156 [2019-10-22 08:58:40,116 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 08:58:40,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 08:58:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-10-22 08:58:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 08:58:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-10-22 08:58:40,134 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-10-22 08:58:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,134 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-10-22 08:58:40,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-10-22 08:58:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:58:40,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-10-22 08:58:40,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982003797] [2019-10-22 08:58:40,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982003797] [2019-10-22 08:58:40,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184098904] [2019-10-22 08:58:40,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,167 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-10-22 08:58:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,183 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-10-22 08:58:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:58:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,185 INFO L225 Difference]: With dead ends: 260 [2019-10-22 08:58:40,185 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 08:58:40,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 08:58:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-10-22 08:58:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-22 08:58:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-10-22 08:58:40,196 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-10-22 08:58:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,196 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-10-22 08:58:40,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-10-22 08:58:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:58:40,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,197 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-10-22 08:58:40,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733665566] [2019-10-22 08:58:40,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733665566] [2019-10-22 08:58:40,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719652943] [2019-10-22 08:58:40,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,237 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-10-22 08:58:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,254 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-10-22 08:58:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:58:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,255 INFO L225 Difference]: With dead ends: 233 [2019-10-22 08:58:40,255 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 08:58:40,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 08:58:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-10-22 08:58:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 08:58:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-10-22 08:58:40,265 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-10-22 08:58:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,265 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-10-22 08:58:40,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-10-22 08:58:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:58:40,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,266 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,266 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-10-22 08:58:40,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204365812] [2019-10-22 08:58:40,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204365812] [2019-10-22 08:58:40,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988120027] [2019-10-22 08:58:40,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,296 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-10-22 08:58:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,314 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-10-22 08:58:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:58:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,316 INFO L225 Difference]: With dead ends: 452 [2019-10-22 08:58:40,316 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 08:58:40,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 08:58:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-10-22 08:58:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-22 08:58:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-10-22 08:58:40,330 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-10-22 08:58:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,330 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-10-22 08:58:40,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-10-22 08:58:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:58:40,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-10-22 08:58:40,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055539255] [2019-10-22 08:58:40,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055539255] [2019-10-22 08:58:40,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379645086] [2019-10-22 08:58:40,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,359 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-10-22 08:58:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,396 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-10-22 08:58:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:58:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,399 INFO L225 Difference]: With dead ends: 384 [2019-10-22 08:58:40,399 INFO L226 Difference]: Without dead ends: 382 [2019-10-22 08:58:40,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-22 08:58:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-10-22 08:58:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-22 08:58:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-10-22 08:58:40,423 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-10-22 08:58:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,424 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-10-22 08:58:40,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-10-22 08:58:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:58:40,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,425 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-10-22 08:58:40,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682696972] [2019-10-22 08:58:40,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682696972] [2019-10-22 08:58:40,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247693352] [2019-10-22 08:58:40,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,478 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-10-22 08:58:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,507 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-10-22 08:58:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:58:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,511 INFO L225 Difference]: With dead ends: 564 [2019-10-22 08:58:40,511 INFO L226 Difference]: Without dead ends: 562 [2019-10-22 08:58:40,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-22 08:58:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-10-22 08:58:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-22 08:58:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-10-22 08:58:40,526 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-10-22 08:58:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,528 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-10-22 08:58:40,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-10-22 08:58:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:58:40,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,535 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,536 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-10-22 08:58:40,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755310998] [2019-10-22 08:58:40,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755310998] [2019-10-22 08:58:40,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893831212] [2019-10-22 08:58:40,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,581 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-10-22 08:58:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,610 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-10-22 08:58:40,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:58:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,613 INFO L225 Difference]: With dead ends: 996 [2019-10-22 08:58:40,613 INFO L226 Difference]: Without dead ends: 586 [2019-10-22 08:58:40,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-22 08:58:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-22 08:58:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-22 08:58:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-10-22 08:58:40,633 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-10-22 08:58:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,633 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-10-22 08:58:40,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-10-22 08:58:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:58:40,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,634 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,635 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-10-22 08:58:40,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823926263] [2019-10-22 08:58:40,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823926263] [2019-10-22 08:58:40,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210744509] [2019-10-22 08:58:40,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,657 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-10-22 08:58:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,675 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-10-22 08:58:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 08:58:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,678 INFO L225 Difference]: With dead ends: 884 [2019-10-22 08:58:40,678 INFO L226 Difference]: Without dead ends: 598 [2019-10-22 08:58:40,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-22 08:58:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-22 08:58:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-22 08:58:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-10-22 08:58:40,693 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-10-22 08:58:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,694 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-10-22 08:58:40,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-10-22 08:58:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:58:40,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,695 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,695 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-10-22 08:58:40,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886762745] [2019-10-22 08:58:40,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886762745] [2019-10-22 08:58:40,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664997624] [2019-10-22 08:58:40,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,733 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-10-22 08:58:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,755 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-10-22 08:58:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 08:58:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,760 INFO L225 Difference]: With dead ends: 1096 [2019-10-22 08:58:40,760 INFO L226 Difference]: Without dead ends: 1094 [2019-10-22 08:58:40,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-10-22 08:58:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-10-22 08:58:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-22 08:58:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-10-22 08:58:40,787 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-10-22 08:58:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,787 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-10-22 08:58:40,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-10-22 08:58:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:58:40,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,792 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,792 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-10-22 08:58:40,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148327062] [2019-10-22 08:58:40,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148327062] [2019-10-22 08:58:40,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819831367] [2019-10-22 08:58:40,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,821 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-10-22 08:58:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,866 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-10-22 08:58:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 08:58:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,871 INFO L225 Difference]: With dead ends: 1976 [2019-10-22 08:58:40,871 INFO L226 Difference]: Without dead ends: 1158 [2019-10-22 08:58:40,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-22 08:58:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-10-22 08:58:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-22 08:58:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-10-22 08:58:40,908 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-10-22 08:58:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:40,908 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-10-22 08:58:40,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-10-22 08:58:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:40,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:40,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-10-22 08:58:40,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576960119] [2019-10-22 08:58:40,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576960119] [2019-10-22 08:58:40,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:40,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:40,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706809925] [2019-10-22 08:58:40,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:40,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:40,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,937 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-10-22 08:58:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:40,962 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-10-22 08:58:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:40,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:58:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:40,966 INFO L225 Difference]: With dead ends: 1736 [2019-10-22 08:58:40,966 INFO L226 Difference]: Without dead ends: 1174 [2019-10-22 08:58:40,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-10-22 08:58:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-10-22 08:58:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-10-22 08:58:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-10-22 08:58:41,001 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-10-22 08:58:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,002 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-10-22 08:58:41,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-10-22 08:58:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:41,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:41,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,004 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-10-22 08:58:41,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869643942] [2019-10-22 08:58:41,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869643942] [2019-10-22 08:58:41,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:41,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663687362] [2019-10-22 08:58:41,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:41,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,025 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-10-22 08:58:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,054 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-10-22 08:58:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:58:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:41,061 INFO L225 Difference]: With dead ends: 2120 [2019-10-22 08:58:41,061 INFO L226 Difference]: Without dead ends: 2118 [2019-10-22 08:58:41,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-10-22 08:58:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-10-22 08:58:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-10-22 08:58:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-10-22 08:58:41,108 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-10-22 08:58:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,109 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-10-22 08:58:41,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-10-22 08:58:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:41,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:41,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,111 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,112 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-10-22 08:58:41,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656781989] [2019-10-22 08:58:41,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656781989] [2019-10-22 08:58:41,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:41,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910606495] [2019-10-22 08:58:41,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:41,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,132 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-10-22 08:58:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,171 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-10-22 08:58:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:58:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:41,178 INFO L225 Difference]: With dead ends: 3912 [2019-10-22 08:58:41,178 INFO L226 Difference]: Without dead ends: 2278 [2019-10-22 08:58:41,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-10-22 08:58:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-10-22 08:58:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-10-22 08:58:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-10-22 08:58:41,232 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-10-22 08:58:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,233 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-10-22 08:58:41,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-10-22 08:58:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:58:41,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:41,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,236 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-10-22 08:58:41,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036172799] [2019-10-22 08:58:41,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036172799] [2019-10-22 08:58:41,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:41,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33977067] [2019-10-22 08:58:41,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:41,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,259 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-10-22 08:58:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,299 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-10-22 08:58:41,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:58:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:41,306 INFO L225 Difference]: With dead ends: 3416 [2019-10-22 08:58:41,306 INFO L226 Difference]: Without dead ends: 2310 [2019-10-22 08:58:41,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-10-22 08:58:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-10-22 08:58:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-10-22 08:58:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-10-22 08:58:41,387 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-10-22 08:58:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,387 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-10-22 08:58:41,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-10-22 08:58:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:58:41,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:41,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,390 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-10-22 08:58:41,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641804092] [2019-10-22 08:58:41,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641804092] [2019-10-22 08:58:41,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:41,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855352626] [2019-10-22 08:58:41,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:41,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,414 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-10-22 08:58:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,461 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-10-22 08:58:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:58:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:41,472 INFO L225 Difference]: With dead ends: 4104 [2019-10-22 08:58:41,473 INFO L226 Difference]: Without dead ends: 4102 [2019-10-22 08:58:41,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-10-22 08:58:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-10-22 08:58:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-10-22 08:58:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-10-22 08:58:41,551 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-10-22 08:58:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,551 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-10-22 08:58:41,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-10-22 08:58:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:58:41,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:41,555 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,556 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,556 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-10-22 08:58:41,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907840167] [2019-10-22 08:58:41,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907840167] [2019-10-22 08:58:41,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:41,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604569827] [2019-10-22 08:58:41,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:41,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,578 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-10-22 08:58:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,644 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-10-22 08:58:41,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:58:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:41,657 INFO L225 Difference]: With dead ends: 7752 [2019-10-22 08:58:41,657 INFO L226 Difference]: Without dead ends: 4486 [2019-10-22 08:58:41,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-10-22 08:58:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-10-22 08:58:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-10-22 08:58:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-10-22 08:58:41,766 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-10-22 08:58:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,766 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-10-22 08:58:41,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-10-22 08:58:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:58:41,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:41,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,770 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-10-22 08:58:41,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377216451] [2019-10-22 08:58:41,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377216451] [2019-10-22 08:58:41,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:41,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349434658] [2019-10-22 08:58:41,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:41,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,789 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-10-22 08:58:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,849 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-10-22 08:58:41,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 08:58:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:41,870 INFO L225 Difference]: With dead ends: 6728 [2019-10-22 08:58:41,874 INFO L226 Difference]: Without dead ends: 4550 [2019-10-22 08:58:41,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-10-22 08:58:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-10-22 08:58:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-10-22 08:58:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-10-22 08:58:41,996 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-10-22 08:58:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:41,996 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-10-22 08:58:41,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-10-22 08:58:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:58:42,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:42,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:42,000 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-10-22 08:58:42,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:42,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51124878] [2019-10-22 08:58:42,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:42,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:42,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:42,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51124878] [2019-10-22 08:58:42,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:42,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:42,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159563335] [2019-10-22 08:58:42,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:42,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:42,026 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-10-22 08:58:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:42,116 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-10-22 08:58:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:42,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 08:58:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:42,139 INFO L225 Difference]: With dead ends: 7944 [2019-10-22 08:58:42,139 INFO L226 Difference]: Without dead ends: 7942 [2019-10-22 08:58:42,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-10-22 08:58:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-10-22 08:58:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-10-22 08:58:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-10-22 08:58:42,286 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-10-22 08:58:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:42,286 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-10-22 08:58:42,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-10-22 08:58:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:58:42,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:42,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:42,295 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-10-22 08:58:42,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:42,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812244868] [2019-10-22 08:58:42,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:42,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:42,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:42,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812244868] [2019-10-22 08:58:42,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:42,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:42,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076015458] [2019-10-22 08:58:42,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:42,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:42,317 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-10-22 08:58:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:42,465 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-10-22 08:58:42,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:42,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 08:58:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:42,484 INFO L225 Difference]: With dead ends: 15368 [2019-10-22 08:58:42,484 INFO L226 Difference]: Without dead ends: 8838 [2019-10-22 08:58:42,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-10-22 08:58:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-10-22 08:58:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-10-22 08:58:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-10-22 08:58:42,766 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-10-22 08:58:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:42,767 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-10-22 08:58:42,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-10-22 08:58:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:58:42,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:42,775 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:42,775 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-10-22 08:58:42,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:42,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237301806] [2019-10-22 08:58:42,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:42,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:42,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:42,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237301806] [2019-10-22 08:58:42,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:42,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:42,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880071134] [2019-10-22 08:58:42,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:42,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:42,803 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-10-22 08:58:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:42,914 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-10-22 08:58:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:42,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:58:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:42,930 INFO L225 Difference]: With dead ends: 13256 [2019-10-22 08:58:42,930 INFO L226 Difference]: Without dead ends: 8966 [2019-10-22 08:58:42,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-10-22 08:58:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-10-22 08:58:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-10-22 08:58:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-10-22 08:58:43,146 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-10-22 08:58:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:43,146 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-10-22 08:58:43,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-10-22 08:58:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:58:43,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:43,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:43,154 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-10-22 08:58:43,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:43,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939367605] [2019-10-22 08:58:43,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:43,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939367605] [2019-10-22 08:58:43,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:43,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:43,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351419695] [2019-10-22 08:58:43,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:43,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:43,180 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-10-22 08:58:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:43,326 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-10-22 08:58:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:43,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:58:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:43,353 INFO L225 Difference]: With dead ends: 15368 [2019-10-22 08:58:43,353 INFO L226 Difference]: Without dead ends: 15366 [2019-10-22 08:58:43,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-10-22 08:58:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-10-22 08:58:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-10-22 08:58:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-10-22 08:58:43,636 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-10-22 08:58:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:43,636 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-10-22 08:58:43,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-10-22 08:58:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:58:43,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:43,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:43,653 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-10-22 08:58:43,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:43,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114023347] [2019-10-22 08:58:43,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:43,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114023347] [2019-10-22 08:58:43,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:43,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:43,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895947047] [2019-10-22 08:58:43,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:43,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:43,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:43,678 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-10-22 08:58:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:43,953 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-10-22 08:58:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:43,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:58:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:43,981 INFO L225 Difference]: With dead ends: 30472 [2019-10-22 08:58:43,981 INFO L226 Difference]: Without dead ends: 17414 [2019-10-22 08:58:43,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-10-22 08:58:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-10-22 08:58:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-10-22 08:58:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-10-22 08:58:44,337 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-10-22 08:58:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:44,337 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-10-22 08:58:44,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-10-22 08:58:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:58:44,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:44,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:44,354 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-10-22 08:58:44,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:44,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960712116] [2019-10-22 08:58:44,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:44,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960712116] [2019-10-22 08:58:44,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:44,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:44,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941741957] [2019-10-22 08:58:44,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:44,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:44,371 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-10-22 08:58:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:44,548 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-10-22 08:58:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:44,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 08:58:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:44,578 INFO L225 Difference]: With dead ends: 26120 [2019-10-22 08:58:44,578 INFO L226 Difference]: Without dead ends: 17670 [2019-10-22 08:58:44,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-10-22 08:58:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-10-22 08:58:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-10-22 08:58:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-10-22 08:58:44,903 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-10-22 08:58:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:44,903 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-10-22 08:58:44,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-10-22 08:58:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:58:45,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:45,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:45,003 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-10-22 08:58:45,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916088744] [2019-10-22 08:58:45,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:45,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916088744] [2019-10-22 08:58:45,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:45,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:45,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830791797] [2019-10-22 08:58:45,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:45,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:45,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:45,025 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-10-22 08:58:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:45,275 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-10-22 08:58:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:45,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 08:58:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:45,323 INFO L225 Difference]: With dead ends: 29704 [2019-10-22 08:58:45,323 INFO L226 Difference]: Without dead ends: 29702 [2019-10-22 08:58:45,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-10-22 08:58:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-10-22 08:58:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-10-22 08:58:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-10-22 08:58:45,784 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-10-22 08:58:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:45,784 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-10-22 08:58:45,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-10-22 08:58:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:58:45,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:45,815 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:45,816 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-10-22 08:58:45,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544882001] [2019-10-22 08:58:45,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:45,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544882001] [2019-10-22 08:58:45,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:45,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:45,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786509116] [2019-10-22 08:58:45,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:45,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:45,838 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-10-22 08:58:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:46,220 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-10-22 08:58:46,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:46,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 08:58:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:46,281 INFO L225 Difference]: With dead ends: 60424 [2019-10-22 08:58:46,282 INFO L226 Difference]: Without dead ends: 34310 [2019-10-22 08:58:46,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-10-22 08:58:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-10-22 08:58:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-10-22 08:58:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-10-22 08:58:47,258 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-10-22 08:58:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:47,258 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-10-22 08:58:47,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-10-22 08:58:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:58:47,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:47,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:47,287 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-10-22 08:58:47,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929226359] [2019-10-22 08:58:47,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929226359] [2019-10-22 08:58:47,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:47,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:47,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837442333] [2019-10-22 08:58:47,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:47,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:47,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:47,303 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-10-22 08:58:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,615 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-10-22 08:58:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:47,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 08:58:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:47,676 INFO L225 Difference]: With dead ends: 51464 [2019-10-22 08:58:47,676 INFO L226 Difference]: Without dead ends: 34822 [2019-10-22 08:58:47,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 08:58:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-10-22 08:58:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-10-22 08:58:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-10-22 08:58:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-10-22 08:58:48,510 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-10-22 08:58:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:48,510 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-10-22 08:58:48,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-10-22 08:58:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:58:48,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:48,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:48,538 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-10-22 08:58:48,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:48,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207265929] [2019-10-22 08:58:48,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:48,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207265929] [2019-10-22 08:58:48,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:48,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:48,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792184885] [2019-10-22 08:58:48,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:48,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:48,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:48,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:48,554 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-10-22 08:58:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:49,078 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-10-22 08:58:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:49,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 08:58:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:49,191 INFO L225 Difference]: With dead ends: 101384 [2019-10-22 08:58:49,192 INFO L226 Difference]: Without dead ends: 67590 [2019-10-22 08:58:49,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-10-22 08:58:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-10-22 08:58:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-10-22 08:58:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-10-22 08:58:50,947 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-10-22 08:58:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-10-22 08:58:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-10-22 08:58:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:58:51,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:51,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:51,000 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-10-22 08:58:51,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:51,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088396923] [2019-10-22 08:58:51,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:51,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:51,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:51,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088396923] [2019-10-22 08:58:51,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:51,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:51,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576904868] [2019-10-22 08:58:51,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:51,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:51,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:51,025 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-10-22 08:58:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:51,612 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-10-22 08:58:51,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:51,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 08:58:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:51,708 INFO L225 Difference]: With dead ends: 71688 [2019-10-22 08:58:51,708 INFO L226 Difference]: Without dead ends: 71686 [2019-10-22 08:58:51,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-10-22 08:58:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-10-22 08:58:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-10-22 08:58:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-10-22 08:58:53,201 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-10-22 08:58:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:53,201 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-10-22 08:58:53,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-10-22 08:58:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:58:53,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:53,245 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:53,245 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-10-22 08:58:53,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65765437] [2019-10-22 08:58:53,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:53,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65765437] [2019-10-22 08:58:53,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:53,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:53,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105655413] [2019-10-22 08:58:53,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:53,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:53,263 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-10-22 08:58:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:54,077 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-10-22 08:58:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:54,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 08:58:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:54,198 INFO L225 Difference]: With dead ends: 109574 [2019-10-22 08:58:54,198 INFO L226 Difference]: Without dead ends: 109572 [2019-10-22 08:58:54,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-10-22 08:58:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-10-22 08:58:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-10-22 08:58:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-10-22 08:58:56,456 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-10-22 08:58:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:56,456 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-10-22 08:58:56,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-10-22 08:58:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:58:56,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:56,535 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:56,535 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-10-22 08:58:56,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523546104] [2019-10-22 08:58:56,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:56,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523546104] [2019-10-22 08:58:56,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:56,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:56,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724331392] [2019-10-22 08:58:56,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:56,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:56,552 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-10-22 08:58:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:57,663 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-10-22 08:58:57,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:57,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 08:58:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:57,664 INFO L225 Difference]: With dead ends: 236548 [2019-10-22 08:58:57,664 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:58:57,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:58:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:58:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:58:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:58:57,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-22 08:58:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:57,734 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:57,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:58:57,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-22 08:58:57,765 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,766 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,767 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-10-22 08:58:57,767 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-22 08:58:57,768 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:58:57,768 INFO L446 ceAbstractionStarter]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-10-22 08:58:57,768 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-22 08:58:57,768 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-10-22 08:58:57,769 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-10-22 08:58:57,769 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-22 08:58:57,770 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-10-22 08:58:57,771 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-10-22 08:58:57,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:57 BoogieIcfgContainer [2019-10-22 08:58:57,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:57,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:57,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:57,780 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:57,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:39" (3/4) ... [2019-10-22 08:58:57,785 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:58:57,801 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 08:58:57,801 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:58:57,858 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b08c7542-148a-4b79-a136-9f5454c6108d/bin/uautomizer/witness.graphml [2019-10-22 08:58:57,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:57,861 INFO L168 Benchmark]: Toolchain (without parser) took 19061.83 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 944.5 MB in the beginning and 853.9 MB in the end (delta: 90.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,862 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -220.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,863 INFO L168 Benchmark]: Boogie Preprocessor took 23.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,863 INFO L168 Benchmark]: RCFGBuilder took 353.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,864 INFO L168 Benchmark]: TraceAbstraction took 18301.39 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 863.9 MB in the end (delta: 268.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,864 INFO L168 Benchmark]: Witness Printer took 79.58 ms. Allocated memory is still 2.7 GB. Free memory was 863.9 MB in the beginning and 853.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,866 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -220.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 353.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18301.39 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 863.9 MB in the end (delta: 268.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 79.58 ms. Allocated memory is still 2.7 GB. Free memory was 863.9 MB in the beginning and 853.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 18.2s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...