./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/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 56f043bec3037ec37b4a132611abd4a337934428 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:32:53,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:32:53,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:32:54,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:32:54,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:32:54,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:32:54,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:32:54,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:32:54,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:32:54,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:32:54,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:32:54,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:32:54,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:32:54,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:32:54,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:32:54,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:32:54,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:32:54,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:32:54,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:32:54,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:32:54,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:32:54,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:32:54,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:32:54,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:32:54,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:32:54,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:32:54,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:32:54,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:32:54,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:32:54,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:32:54,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:32:54,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:32:54,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:32:54,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:32:54,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:32:54,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:32:54,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:32:54,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:32:54,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:32:54,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:32:54,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:32:54,065 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:32:54,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:32:54,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:32:54,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:32:54,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:32:54,102 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:32:54,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:32:54,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:32:54,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:32:54,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:32:54,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:32:54,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:32:54,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:32:54,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:32:54,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:32:54,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:32:54,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:32:54,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:32:54,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:32:54,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:32:54,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:32:54,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:32:54,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:32:54,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:32:54,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:32:54,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:32:54,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:32:54,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:32:54,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:32:54,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-11-15 23:32:54,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:32:54,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:32:54,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:32:54,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:32:54,164 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:32:54,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_11.c [2019-11-15 23:32:54,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/data/d37e35874/2758da0cb70c40d4836aab8e0830acce/FLAGf65f476c6 [2019-11-15 23:32:54,620 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:32:54,622 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/sv-benchmarks/c/locks/test_locks_11.c [2019-11-15 23:32:54,631 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/data/d37e35874/2758da0cb70c40d4836aab8e0830acce/FLAGf65f476c6 [2019-11-15 23:32:55,031 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/data/d37e35874/2758da0cb70c40d4836aab8e0830acce [2019-11-15 23:32:55,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:32:55,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:32:55,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:55,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:32:55,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:32:55,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6136fe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55, skipping insertion in model container [2019-11-15 23:32:55,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,049 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:32:55,071 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:32:55,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:55,337 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:32:55,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:55,373 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:32:55,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55 WrapperNode [2019-11-15 23:32:55,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:55,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:32:55,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:32:55,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:32:55,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:32:55,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:32:55,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:32:55,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:32:55,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... [2019-11-15 23:32:55,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:32:55,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:32:55,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:32:55,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:32:55,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:32:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:32:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:32:55,891 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:32:55,891 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:32:55,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:55 BoogieIcfgContainer [2019-11-15 23:32:55,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:32:55,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:32:55,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:32:55,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:32:55,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:32:55" (1/3) ... [2019-11-15 23:32:55,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbd4749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:55, skipping insertion in model container [2019-11-15 23:32:55,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:55" (2/3) ... [2019-11-15 23:32:55,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbd4749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:55, skipping insertion in model container [2019-11-15 23:32:55,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:55" (3/3) ... [2019-11-15 23:32:55,901 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-15 23:32:55,909 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:32:55,915 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:32:55,929 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:32:55,948 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:32:55,948 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:32:55,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:32:55,948 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:32:55,948 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:32:55,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:32:55,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:32:55,949 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:32:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-15 23:32:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:32:55,966 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:55,967 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:55,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-11-15 23:32:55,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:55,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716298396] [2019-11-15 23:32:55,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:55,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:55,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716298396] [2019-11-15 23:32:56,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521200860] [2019-11-15 23:32:56,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,152 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-11-15 23:32:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,209 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-11-15 23:32:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 23:32:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,221 INFO L225 Difference]: With dead ends: 88 [2019-11-15 23:32:56,221 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 23:32:56,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-11-15 23:32:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 23:32:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-11-15 23:32:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:32:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-11-15 23:32:56,257 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-11-15 23:32:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,258 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-11-15 23:32:56,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-11-15 23:32:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:32:56,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:56,260 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-11-15 23:32:56,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818990765] [2019-11-15 23:32:56,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818990765] [2019-11-15 23:32:56,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727667561] [2019-11-15 23:32:56,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,317 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-11-15 23:32:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,345 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-11-15 23:32:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 23:32:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,348 INFO L225 Difference]: With dead ends: 123 [2019-11-15 23:32:56,349 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 23:32:56,349 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-11-15 23:32:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 23:32:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-15 23:32:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 23:32:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-11-15 23:32:56,364 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-11-15 23:32:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,365 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-11-15 23:32:56,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-11-15 23:32:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:32:56,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:56,367 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-11-15 23:32:56,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255151613] [2019-11-15 23:32:56,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255151613] [2019-11-15 23:32:56,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306056915] [2019-11-15 23:32:56,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,412 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-11-15 23:32:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,444 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-11-15 23:32:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:32:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,446 INFO L225 Difference]: With dead ends: 113 [2019-11-15 23:32:56,446 INFO L226 Difference]: Without dead ends: 77 [2019-11-15 23:32:56,446 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-11-15 23:32:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-15 23:32:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-11-15 23:32:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 23:32:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-11-15 23:32:56,455 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-11-15 23:32:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-11-15 23:32:56,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-11-15 23:32:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:32:56,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:56,457 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-11-15 23:32:56,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507467477] [2019-11-15 23:32:56,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507467477] [2019-11-15 23:32:56,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702901843] [2019-11-15 23:32:56,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,501 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-11-15 23:32:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,548 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-11-15 23:32:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:32:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,551 INFO L225 Difference]: With dead ends: 144 [2019-11-15 23:32:56,551 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 23:32:56,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 23:32:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-11-15 23:32:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:32:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-11-15 23:32:56,563 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-11-15 23:32:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,563 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-11-15 23:32:56,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-11-15 23:32:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:32:56,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,565 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:56,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-11-15 23:32:56,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275044140] [2019-11-15 23:32:56,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275044140] [2019-11-15 23:32:56,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330557396] [2019-11-15 23:32:56,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,601 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-11-15 23:32:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,621 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-11-15 23:32:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:32:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,623 INFO L225 Difference]: With dead ends: 240 [2019-11-15 23:32:56,623 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:32:56,624 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-11-15 23:32:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:32:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-11-15 23:32:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 23:32:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-11-15 23:32:56,639 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-11-15 23:32:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,639 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-11-15 23:32:56,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-11-15 23:32:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:32:56,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,640 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-11-15 23:32:56,641 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-11-15 23:32:56,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283772767] [2019-11-15 23:32:56,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283772767] [2019-11-15 23:32:56,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131722014] [2019-11-15 23:32:56,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,716 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-11-15 23:32:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,739 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-11-15 23:32:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:32:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,741 INFO L225 Difference]: With dead ends: 215 [2019-11-15 23:32:56,741 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 23:32:56,742 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-11-15 23:32:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 23:32:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-15 23:32:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:32:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-11-15 23:32:56,752 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-11-15 23:32:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,752 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-11-15 23:32:56,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-11-15 23:32:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:32:56,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,754 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-11-15 23:32:56,754 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-11-15 23:32:56,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878210689] [2019-11-15 23:32:56,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878210689] [2019-11-15 23:32:56,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969451504] [2019-11-15 23:32:56,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,786 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-11-15 23:32:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,810 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-11-15 23:32:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:32:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,812 INFO L225 Difference]: With dead ends: 416 [2019-11-15 23:32:56,812 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 23:32:56,814 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-11-15 23:32:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 23:32:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-11-15 23:32:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-15 23:32:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-11-15 23:32:56,828 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-11-15 23:32:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,829 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-11-15 23:32:56,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-11-15 23:32:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:32:56,831 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,831 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-11-15 23:32:56,831 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-11-15 23:32:56,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244687127] [2019-11-15 23:32:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244687127] [2019-11-15 23:32:56,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501085778] [2019-11-15 23:32:56,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,858 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-11-15 23:32:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,880 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-11-15 23:32:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:32:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,882 INFO L225 Difference]: With dead ends: 352 [2019-11-15 23:32:56,882 INFO L226 Difference]: Without dead ends: 350 [2019-11-15 23:32:56,883 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-11-15 23:32:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-15 23:32:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-11-15 23:32:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-15 23:32:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-11-15 23:32:56,904 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-11-15 23:32:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,904 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-11-15 23:32:56,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-11-15 23:32:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:32:56,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,912 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-11-15 23:32:56,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-11-15 23:32:56,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937271622] [2019-11-15 23:32:56,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937271622] [2019-11-15 23:32:56,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:56,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443380961] [2019-11-15 23:32:56,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:56,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:56,956 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-11-15 23:32:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,980 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-11-15 23:32:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:56,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 23:32:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,984 INFO L225 Difference]: With dead ends: 516 [2019-11-15 23:32:56,984 INFO L226 Difference]: Without dead ends: 514 [2019-11-15 23:32:56,985 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-11-15 23:32:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-15 23:32:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-11-15 23:32:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-15 23:32:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-11-15 23:32:57,007 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-11-15 23:32:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,008 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-11-15 23:32:57,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-11-15 23:32:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:32:57,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,010 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-11-15 23:32:57,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-11-15 23:32:57,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103768143] [2019-11-15 23:32:57,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103768143] [2019-11-15 23:32:57,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681028820] [2019-11-15 23:32:57,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,057 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-11-15 23:32:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,087 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-11-15 23:32:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 23:32:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,092 INFO L225 Difference]: With dead ends: 916 [2019-11-15 23:32:57,092 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 23:32:57,096 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-11-15 23:32:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 23:32:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-11-15 23:32:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-15 23:32:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-11-15 23:32:57,119 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-11-15 23:32:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,120 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-11-15 23:32:57,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-11-15 23:32:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:57,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,121 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-11-15 23:32:57,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-11-15 23:32:57,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694967431] [2019-11-15 23:32:57,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694967431] [2019-11-15 23:32:57,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878439490] [2019-11-15 23:32:57,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,165 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-11-15 23:32:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,192 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-11-15 23:32:57,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:32:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,197 INFO L225 Difference]: With dead ends: 812 [2019-11-15 23:32:57,197 INFO L226 Difference]: Without dead ends: 550 [2019-11-15 23:32:57,197 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-11-15 23:32:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-15 23:32:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-15 23:32:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-15 23:32:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-11-15 23:32:57,213 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-11-15 23:32:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,214 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-11-15 23:32:57,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-11-15 23:32:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:57,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,215 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-11-15 23:32:57,215 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-11-15 23:32:57,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926607606] [2019-11-15 23:32:57,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926607606] [2019-11-15 23:32:57,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359327698] [2019-11-15 23:32:57,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,235 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-11-15 23:32:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,255 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-11-15 23:32:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:32:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,261 INFO L225 Difference]: With dead ends: 1000 [2019-11-15 23:32:57,262 INFO L226 Difference]: Without dead ends: 998 [2019-11-15 23:32:57,262 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-11-15 23:32:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-11-15 23:32:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-11-15 23:32:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-15 23:32:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-11-15 23:32:57,288 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-11-15 23:32:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,288 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-11-15 23:32:57,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-11-15 23:32:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:57,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,290 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-11-15 23:32:57,291 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-11-15 23:32:57,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41572896] [2019-11-15 23:32:57,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41572896] [2019-11-15 23:32:57,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871100526] [2019-11-15 23:32:57,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,326 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-11-15 23:32:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,366 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-11-15 23:32:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:32:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,375 INFO L225 Difference]: With dead ends: 1816 [2019-11-15 23:32:57,375 INFO L226 Difference]: Without dead ends: 1062 [2019-11-15 23:32:57,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-15 23:32:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-11-15 23:32:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-15 23:32:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-11-15 23:32:57,409 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-11-15 23:32:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,409 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-11-15 23:32:57,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-11-15 23:32:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:32:57,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,414 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-11-15 23:32:57,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-11-15 23:32:57,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769251683] [2019-11-15 23:32:57,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769251683] [2019-11-15 23:32:57,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471614451] [2019-11-15 23:32:57,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,447 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-11-15 23:32:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,477 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-11-15 23:32:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:32:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,485 INFO L225 Difference]: With dead ends: 1592 [2019-11-15 23:32:57,485 INFO L226 Difference]: Without dead ends: 1078 [2019-11-15 23:32:57,486 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-11-15 23:32:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-11-15 23:32:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-11-15 23:32:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-15 23:32:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-11-15 23:32:57,521 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-11-15 23:32:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,522 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-11-15 23:32:57,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-11-15 23:32:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:32:57,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,524 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-11-15 23:32:57,524 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-11-15 23:32:57,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965641808] [2019-11-15 23:32:57,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965641808] [2019-11-15 23:32:57,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083217162] [2019-11-15 23:32:57,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,555 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-11-15 23:32:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,589 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-11-15 23:32:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:32:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,600 INFO L225 Difference]: With dead ends: 1928 [2019-11-15 23:32:57,600 INFO L226 Difference]: Without dead ends: 1926 [2019-11-15 23:32:57,603 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-11-15 23:32:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-15 23:32:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-11-15 23:32:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-15 23:32:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-11-15 23:32:57,657 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-11-15 23:32:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,658 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-11-15 23:32:57,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-11-15 23:32:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:32:57,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,662 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-11-15 23:32:57,662 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-11-15 23:32:57,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677215912] [2019-11-15 23:32:57,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677215912] [2019-11-15 23:32:57,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244369266] [2019-11-15 23:32:57,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,684 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-11-15 23:32:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,740 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-11-15 23:32:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:32:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,752 INFO L225 Difference]: With dead ends: 3592 [2019-11-15 23:32:57,752 INFO L226 Difference]: Without dead ends: 2086 [2019-11-15 23:32:57,754 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-11-15 23:32:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-11-15 23:32:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-11-15 23:32:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-15 23:32:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-11-15 23:32:57,817 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-11-15 23:32:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,817 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-11-15 23:32:57,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-11-15 23:32:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:32:57,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,820 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-11-15 23:32:57,820 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-11-15 23:32:57,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642919223] [2019-11-15 23:32:57,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:57,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642919223] [2019-11-15 23:32:57,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:57,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:57,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229904874] [2019-11-15 23:32:57,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:57,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:57,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:57,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:57,847 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-11-15 23:32:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,893 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-11-15 23:32:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:57,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:32:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,905 INFO L225 Difference]: With dead ends: 3128 [2019-11-15 23:32:57,905 INFO L226 Difference]: Without dead ends: 2118 [2019-11-15 23:32:57,907 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-11-15 23:32:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-15 23:32:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-11-15 23:32:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-15 23:32:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-11-15 23:32:58,002 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-11-15 23:32:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:58,002 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-11-15 23:32:58,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-11-15 23:32:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:32:58,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:58,005 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-11-15 23:32:58,005 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-11-15 23:32:58,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:58,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047517178] [2019-11-15 23:32:58,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,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-11-15 23:32:58,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047517178] [2019-11-15 23:32:58,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:58,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:58,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124209697] [2019-11-15 23:32:58,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:58,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:58,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:58,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:58,027 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-11-15 23:32:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:58,082 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-11-15 23:32:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:58,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:32:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:58,101 INFO L225 Difference]: With dead ends: 3720 [2019-11-15 23:32:58,102 INFO L226 Difference]: Without dead ends: 3718 [2019-11-15 23:32:58,103 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-11-15 23:32:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-15 23:32:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-11-15 23:32:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-11-15 23:32:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-11-15 23:32:58,196 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-11-15 23:32:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:58,197 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-11-15 23:32:58,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-11-15 23:32:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:32:58,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:58,202 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-11-15 23:32:58,202 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:58,203 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-11-15 23:32:58,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:58,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438038052] [2019-11-15 23:32:58,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:58,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438038052] [2019-11-15 23:32:58,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:58,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:58,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96697673] [2019-11-15 23:32:58,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:58,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:58,223 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-11-15 23:32:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:58,300 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-11-15 23:32:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:58,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:32:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:58,323 INFO L225 Difference]: With dead ends: 7112 [2019-11-15 23:32:58,323 INFO L226 Difference]: Without dead ends: 4102 [2019-11-15 23:32:58,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-15 23:32:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-11-15 23:32:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-11-15 23:32:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-11-15 23:32:58,445 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-11-15 23:32:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:58,445 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-11-15 23:32:58,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-11-15 23:32:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:32:58,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:58,450 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-11-15 23:32:58,450 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-11-15 23:32:58,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:58,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935130558] [2019-11-15 23:32:58,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:58,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935130558] [2019-11-15 23:32:58,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:58,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:58,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723967369] [2019-11-15 23:32:58,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:58,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:58,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:58,478 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-11-15 23:32:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:58,545 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-11-15 23:32:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:58,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:32:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:58,584 INFO L225 Difference]: With dead ends: 6152 [2019-11-15 23:32:58,584 INFO L226 Difference]: Without dead ends: 4166 [2019-11-15 23:32:58,587 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-11-15 23:32:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-15 23:32:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-11-15 23:32:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-11-15 23:32:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-11-15 23:32:58,711 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-11-15 23:32:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:58,712 INFO L462 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-11-15 23:32:58,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-11-15 23:32:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:32:58,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:58,717 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-11-15 23:32:58,717 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:58,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-11-15 23:32:58,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:58,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097345433] [2019-11-15 23:32:58,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:58,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:58,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097345433] [2019-11-15 23:32:58,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:58,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:58,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973216766] [2019-11-15 23:32:58,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:58,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:58,743 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-11-15 23:32:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:58,848 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-11-15 23:32:58,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:58,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:32:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:58,861 INFO L225 Difference]: With dead ends: 7176 [2019-11-15 23:32:58,861 INFO L226 Difference]: Without dead ends: 7174 [2019-11-15 23:32:58,863 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-11-15 23:32:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-11-15 23:32:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-11-15 23:32:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-11-15 23:32:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-11-15 23:32:59,004 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-11-15 23:32:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:59,004 INFO L462 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-11-15 23:32:59,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-11-15 23:32:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:32:59,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:59,013 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-11-15 23:32:59,013 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-11-15 23:32:59,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:59,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072620661] [2019-11-15 23:32:59,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:59,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072620661] [2019-11-15 23:32:59,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:59,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:59,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282584135] [2019-11-15 23:32:59,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:59,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:59,031 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-11-15 23:32:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:59,150 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-11-15 23:32:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:59,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:32:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:59,165 INFO L225 Difference]: With dead ends: 14088 [2019-11-15 23:32:59,165 INFO L226 Difference]: Without dead ends: 8070 [2019-11-15 23:32:59,173 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-11-15 23:32:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-11-15 23:32:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-11-15 23:32:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-11-15 23:32:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-11-15 23:32:59,423 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-11-15 23:32:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:59,423 INFO L462 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-11-15 23:32:59,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-11-15 23:32:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:32:59,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:59,433 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-11-15 23:32:59,433 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:59,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:59,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-11-15 23:32:59,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:59,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575013016] [2019-11-15 23:32:59,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:59,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575013016] [2019-11-15 23:32:59,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:59,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:59,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716219255] [2019-11-15 23:32:59,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:59,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:59,453 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-11-15 23:32:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:59,549 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-11-15 23:32:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:59,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:32:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:59,564 INFO L225 Difference]: With dead ends: 12104 [2019-11-15 23:32:59,564 INFO L226 Difference]: Without dead ends: 8198 [2019-11-15 23:32:59,569 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-11-15 23:32:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-11-15 23:32:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-11-15 23:32:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-11-15 23:32:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-11-15 23:32:59,756 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-11-15 23:32:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:59,756 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-11-15 23:32:59,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-11-15 23:32:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:32:59,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:59,766 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-11-15 23:32:59,766 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:32:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-11-15 23:32:59,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:59,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993424635] [2019-11-15 23:32:59,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:59,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993424635] [2019-11-15 23:32:59,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:59,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:59,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122925106] [2019-11-15 23:32:59,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:59,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:59,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:59,782 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-11-15 23:32:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:59,936 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-11-15 23:32:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:59,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:32:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:59,960 INFO L225 Difference]: With dead ends: 13832 [2019-11-15 23:32:59,960 INFO L226 Difference]: Without dead ends: 13830 [2019-11-15 23:32:59,964 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-11-15 23:32:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-11-15 23:33:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-11-15 23:33:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-11-15 23:33:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-11-15 23:33:00,209 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-11-15 23:33:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:00,209 INFO L462 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-11-15 23:33:00,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-11-15 23:33:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:33:00,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:00,225 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-11-15 23:33:00,226 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-11-15 23:33:00,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:00,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741041571] [2019-11-15 23:33:00,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:00,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:00,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:00,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741041571] [2019-11-15 23:33:00,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:00,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:00,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169013917] [2019-11-15 23:33:00,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:00,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:00,244 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-11-15 23:33:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:00,490 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-11-15 23:33:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:00,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:33:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:00,580 INFO L225 Difference]: With dead ends: 27912 [2019-11-15 23:33:00,580 INFO L226 Difference]: Without dead ends: 15878 [2019-11-15 23:33:00,591 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-11-15 23:33:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-11-15 23:33:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-11-15 23:33:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-11-15 23:33:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-11-15 23:33:00,895 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-11-15 23:33:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:00,895 INFO L462 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-11-15 23:33:00,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-11-15 23:33:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:33:00,912 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:00,912 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-11-15 23:33:00,913 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-11-15 23:33:00,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:00,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144623808] [2019-11-15 23:33:00,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:00,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:00,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:00,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144623808] [2019-11-15 23:33:00,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:00,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:00,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088063263] [2019-11-15 23:33:00,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:00,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:00,943 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-11-15 23:33:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:01,097 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-11-15 23:33:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:01,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:33:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:01,121 INFO L225 Difference]: With dead ends: 23816 [2019-11-15 23:33:01,121 INFO L226 Difference]: Without dead ends: 16134 [2019-11-15 23:33:01,132 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-11-15 23:33:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-11-15 23:33:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-11-15 23:33:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-11-15 23:33:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-11-15 23:33:01,443 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-11-15 23:33:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:01,443 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-11-15 23:33:01,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-11-15 23:33:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:33:01,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:01,461 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-11-15 23:33:01,462 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-11-15 23:33:01,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:01,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107435232] [2019-11-15 23:33:01,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:01,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:01,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:01,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107435232] [2019-11-15 23:33:01,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:01,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:01,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816919277] [2019-11-15 23:33:01,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:01,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:01,479 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-11-15 23:33:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:01,805 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-11-15 23:33:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:01,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:33:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:01,842 INFO L225 Difference]: With dead ends: 26632 [2019-11-15 23:33:01,843 INFO L226 Difference]: Without dead ends: 26630 [2019-11-15 23:33:01,848 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-11-15 23:33:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-11-15 23:33:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-11-15 23:33:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-11-15 23:33:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-11-15 23:33:02,266 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-11-15 23:33:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:02,266 INFO L462 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-11-15 23:33:02,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-11-15 23:33:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:33:02,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:02,298 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-11-15 23:33:02,298 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-11-15 23:33:02,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:02,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604134555] [2019-11-15 23:33:02,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:02,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:02,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:02,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604134555] [2019-11-15 23:33:02,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:02,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:02,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521747854] [2019-11-15 23:33:02,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:02,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:02,315 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-11-15 23:33:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:02,634 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-11-15 23:33:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:02,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:33:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:02,678 INFO L225 Difference]: With dead ends: 55304 [2019-11-15 23:33:02,678 INFO L226 Difference]: Without dead ends: 31238 [2019-11-15 23:33:02,702 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-11-15 23:33:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-11-15 23:33:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-11-15 23:33:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-11-15 23:33:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-11-15 23:33:03,375 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-11-15 23:33:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:03,376 INFO L462 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-11-15 23:33:03,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-11-15 23:33:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:33:03,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:03,401 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-11-15 23:33:03,401 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-11-15 23:33:03,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:03,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560990699] [2019-11-15 23:33:03,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:03,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:03,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:03,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560990699] [2019-11-15 23:33:03,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:03,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:03,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029521069] [2019-11-15 23:33:03,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:03,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:03,421 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-11-15 23:33:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:03,695 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-11-15 23:33:03,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:03,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:33:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:03,734 INFO L225 Difference]: With dead ends: 46856 [2019-11-15 23:33:03,734 INFO L226 Difference]: Without dead ends: 31750 [2019-11-15 23:33:03,748 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-11-15 23:33:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-11-15 23:33:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-11-15 23:33:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-15 23:33:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-11-15 23:33:04,493 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-11-15 23:33:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:04,493 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-11-15 23:33:04,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-11-15 23:33:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:33:04,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:04,509 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-11-15 23:33:04,509 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-11-15 23:33:04,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:04,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255253347] [2019-11-15 23:33:04,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:04,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255253347] [2019-11-15 23:33:04,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:04,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:04,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827325340] [2019-11-15 23:33:04,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:04,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:04,525 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-11-15 23:33:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:05,091 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-11-15 23:33:05,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:05,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:33:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:05,134 INFO L225 Difference]: With dead ends: 92166 [2019-11-15 23:33:05,134 INFO L226 Difference]: Without dead ends: 31748 [2019-11-15 23:33:05,167 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-11-15 23:33:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-11-15 23:33:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-11-15 23:33:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-15 23:33:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-11-15 23:33:05,687 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-11-15 23:33:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:05,688 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-11-15 23:33:05,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-11-15 23:33:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:33:05,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:05,705 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-11-15 23:33:05,705 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:05,706 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-11-15 23:33:05,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:05,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294688539] [2019-11-15 23:33:05,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:05,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294688539] [2019-11-15 23:33:05,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:05,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:05,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097065199] [2019-11-15 23:33:05,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:05,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:05,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:05,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,730 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-11-15 23:33:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:06,202 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-11-15 23:33:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:06,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:33:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:06,202 INFO L225 Difference]: With dead ends: 31748 [2019-11-15 23:33:06,202 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:33:06,210 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-11-15 23:33:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:33:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:33:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:33:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:33:06,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-11-15 23:33:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:06,211 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:33:06,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:33:06,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:33:06,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:33:06,236 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 23:33:06,236 INFO L446 ceAbstractionStarter]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-11-15 23:33:06,236 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-15 23:33:06,236 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-15 23:33:06,236 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:33:06,236 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:33:06,237 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,238 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 23:33:06,239 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-15 23:33:06,239 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,239 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-11-15 23:33:06,239 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-11-15 23:33:06,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:33:06 BoogieIcfgContainer [2019-11-15 23:33:06,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:33:06,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:33:06,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:33:06,246 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:33:06,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:55" (3/4) ... [2019-11-15 23:33:06,249 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:33:06,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:33:06,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:33:06,342 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fed9236e-13d5-4420-b756-fba19007ff85/bin/uautomizer/witness.graphml [2019-11-15 23:33:06,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:33:06,346 INFO L168 Benchmark]: Toolchain (without parser) took 11310.00 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 848.8 MB). Free memory was 950.1 MB in the beginning and 1.5 GB in the end (delta: -510.9 MB). Peak memory consumption was 337.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:06,346 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:06,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -243.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:06,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.48 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-11-15 23:33:06,347 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 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-11-15 23:33:06,348 INFO L168 Benchmark]: RCFGBuilder took 425.25 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:06,348 INFO L168 Benchmark]: TraceAbstraction took 10352.06 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 645.9 MB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -302.0 MB). Peak memory consumption was 344.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:06,349 INFO L168 Benchmark]: Witness Printer took 97.17 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:06,351 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -243.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.48 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 36.44 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. * RCFGBuilder took 425.25 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10352.06 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 645.9 MB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -302.0 MB). Peak memory consumption was 344.0 MB. Max. memory is 11.5 GB. * Witness Printer took 97.17 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Result: SAFE, OverallTime: 10.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 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, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...