./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:10,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:10,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:10,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:10,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:10,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:10,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:10,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:10,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:10,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:10,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:10,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:10,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:10,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:10,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:10,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:10,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:10,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:10,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:10,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:10,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:10,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:10,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:10,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:10,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:10,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:10,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:10,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:10,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:10,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:10,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:10,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:10,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:10,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:10,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:10,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:10,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:10,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:10,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:10,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:10,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:10,862 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:10,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:10,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:10,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:10,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:10,883 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:10,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:10,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:10,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:10,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:10,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:10,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:10,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:10,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:10,886 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:10,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:10,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:10,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:10,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:10,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:10,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:10,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:10,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:10,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:10,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:10,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:10,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:10,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:10,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:10,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-10-22 09:02:10,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:10,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:10,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:10,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:10,943 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:10,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2019-10-22 09:02:10,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/data/37218bb48/485a7841552746a3a4162a16cee8ba9b/FLAG36bbaf033 [2019-10-22 09:02:11,395 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:11,395 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/sv-benchmarks/c/locks/test_locks_13.c [2019-10-22 09:02:11,402 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/data/37218bb48/485a7841552746a3a4162a16cee8ba9b/FLAG36bbaf033 [2019-10-22 09:02:11,412 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/data/37218bb48/485a7841552746a3a4162a16cee8ba9b [2019-10-22 09:02:11,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:11,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:11,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:11,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:11,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:11,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d01eb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11, skipping insertion in model container [2019-10-22 09:02:11,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:11,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:11,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:11,625 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:11,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:11,762 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:11,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11 WrapperNode [2019-10-22 09:02:11,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:11,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:11,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:11,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:11,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:11,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:11,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:11,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:11,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:11,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:11,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:11,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:11,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:12,249 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:12,249 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:02:12,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:12 BoogieIcfgContainer [2019-10-22 09:02:12,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:12,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:12,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:12,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:12,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:11" (1/3) ... [2019-10-22 09:02:12,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66be109a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:12, skipping insertion in model container [2019-10-22 09:02:12,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (2/3) ... [2019-10-22 09:02:12,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66be109a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:12, skipping insertion in model container [2019-10-22 09:02:12,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:12" (3/3) ... [2019-10-22 09:02:12,259 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-22 09:02:12,267 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:12,272 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:12,282 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:12,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:12,305 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:12,305 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:12,305 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:12,305 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:12,306 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:12,306 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:12,306 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-10-22 09:02:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 09:02:12,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,326 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2019-10-22 09:02:12,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245560628] [2019-10-22 09:02:12,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245560628] [2019-10-22 09:02:12,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:12,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238197113] [2019-10-22 09:02:12,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:12,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,527 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-10-22 09:02:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,567 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2019-10-22 09:02:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:12,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 09:02:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,580 INFO L225 Difference]: With dead ends: 100 [2019-10-22 09:02:12,580 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 09:02:12,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 09:02:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-10-22 09:02:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 09:02:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-10-22 09:02:12,617 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2019-10-22 09:02:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,617 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-10-22 09:02:12,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-10-22 09:02:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 09:02:12,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,619 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2019-10-22 09:02:12,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546012655] [2019-10-22 09:02:12,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546012655] [2019-10-22 09:02:12,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:12,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762415544] [2019-10-22 09:02:12,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:12,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:12,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,710 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2019-10-22 09:02:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,744 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2019-10-22 09:02:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:12,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 09:02:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,746 INFO L225 Difference]: With dead ends: 143 [2019-10-22 09:02:12,746 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 09:02:12,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 09:02:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-10-22 09:02:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:02:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2019-10-22 09:02:12,755 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2019-10-22 09:02:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,755 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2019-10-22 09:02:12,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2019-10-22 09:02:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:02:12,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,756 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,756 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2019-10-22 09:02:12,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569663743] [2019-10-22 09:02:12,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569663743] [2019-10-22 09:02:12,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:12,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231311002] [2019-10-22 09:02:12,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:12,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,797 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2019-10-22 09:02:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,814 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2019-10-22 09:02:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:12,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:02:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,815 INFO L225 Difference]: With dead ends: 131 [2019-10-22 09:02:12,815 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 09:02:12,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 09:02:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-10-22 09:02:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 09:02:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2019-10-22 09:02:12,826 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2019-10-22 09:02:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,826 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2019-10-22 09:02:12,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2019-10-22 09:02:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:02:12,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,827 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2019-10-22 09:02:12,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920335121] [2019-10-22 09:02:12,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920335121] [2019-10-22 09:02:12,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:12,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987949427] [2019-10-22 09:02:12,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:12,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,876 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2019-10-22 09:02:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,893 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2019-10-22 09:02:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:12,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:02:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,895 INFO L225 Difference]: With dead ends: 168 [2019-10-22 09:02:12,895 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 09:02:12,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 09:02:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2019-10-22 09:02:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-22 09:02:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2019-10-22 09:02:12,905 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2019-10-22 09:02:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,906 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2019-10-22 09:02:12,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2019-10-22 09:02:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:02:12,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,907 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2019-10-22 09:02:12,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158411444] [2019-10-22 09:02:12,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158411444] [2019-10-22 09:02:12,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:12,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603879210] [2019-10-22 09:02:12,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:12,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,949 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2019-10-22 09:02:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,966 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2019-10-22 09:02:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:12,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:02:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,968 INFO L225 Difference]: With dead ends: 280 [2019-10-22 09:02:12,968 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 09:02:12,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 09:02:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-10-22 09:02:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-22 09:02:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2019-10-22 09:02:12,980 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2019-10-22 09:02:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,981 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2019-10-22 09:02:12,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2019-10-22 09:02:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:02:12,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,982 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2019-10-22 09:02:12,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070472920] [2019-10-22 09:02:12,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070472920] [2019-10-22 09:02:13,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233380961] [2019-10-22 09:02:13,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,037 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2019-10-22 09:02:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,062 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2019-10-22 09:02:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 09:02:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,064 INFO L225 Difference]: With dead ends: 251 [2019-10-22 09:02:13,065 INFO L226 Difference]: Without dead ends: 170 [2019-10-22 09:02:13,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-22 09:02:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-10-22 09:02:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-22 09:02:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2019-10-22 09:02:13,085 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2019-10-22 09:02:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,085 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2019-10-22 09:02:13,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2019-10-22 09:02:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:02:13,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2019-10-22 09:02:13,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242998144] [2019-10-22 09:02:13,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242998144] [2019-10-22 09:02:13,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560993353] [2019-10-22 09:02:13,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,147 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2019-10-22 09:02:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,186 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2019-10-22 09:02:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 09:02:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,188 INFO L225 Difference]: With dead ends: 488 [2019-10-22 09:02:13,188 INFO L226 Difference]: Without dead ends: 326 [2019-10-22 09:02:13,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-22 09:02:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2019-10-22 09:02:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-22 09:02:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2019-10-22 09:02:13,222 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2019-10-22 09:02:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,223 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2019-10-22 09:02:13,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2019-10-22 09:02:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:02:13,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,231 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,231 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2019-10-22 09:02:13,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467008426] [2019-10-22 09:02:13,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467008426] [2019-10-22 09:02:13,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354242748] [2019-10-22 09:02:13,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,271 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2019-10-22 09:02:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,292 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2019-10-22 09:02:13,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 09:02:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,295 INFO L225 Difference]: With dead ends: 416 [2019-10-22 09:02:13,295 INFO L226 Difference]: Without dead ends: 414 [2019-10-22 09:02:13,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-10-22 09:02:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2019-10-22 09:02:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-22 09:02:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2019-10-22 09:02:13,318 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2019-10-22 09:02:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,318 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2019-10-22 09:02:13,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2019-10-22 09:02:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 09:02:13,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,319 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,323 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2019-10-22 09:02:13,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881676839] [2019-10-22 09:02:13,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881676839] [2019-10-22 09:02:13,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096865542] [2019-10-22 09:02:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,361 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2019-10-22 09:02:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,390 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2019-10-22 09:02:13,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 09:02:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,393 INFO L225 Difference]: With dead ends: 612 [2019-10-22 09:02:13,394 INFO L226 Difference]: Without dead ends: 610 [2019-10-22 09:02:13,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-22 09:02:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2019-10-22 09:02:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-22 09:02:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2019-10-22 09:02:13,415 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2019-10-22 09:02:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,415 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2019-10-22 09:02:13,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2019-10-22 09:02:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 09:02:13,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,417 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2019-10-22 09:02:13,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226634158] [2019-10-22 09:02:13,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226634158] [2019-10-22 09:02:13,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287999992] [2019-10-22 09:02:13,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,446 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2019-10-22 09:02:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,481 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2019-10-22 09:02:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 09:02:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,484 INFO L225 Difference]: With dead ends: 1076 [2019-10-22 09:02:13,484 INFO L226 Difference]: Without dead ends: 634 [2019-10-22 09:02:13,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-22 09:02:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-10-22 09:02:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-22 09:02:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2019-10-22 09:02:13,510 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2019-10-22 09:02:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,510 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2019-10-22 09:02:13,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2019-10-22 09:02:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:02:13,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,514 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,514 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2019-10-22 09:02:13,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12429256] [2019-10-22 09:02:13,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12429256] [2019-10-22 09:02:13,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795916524] [2019-10-22 09:02:13,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,544 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2019-10-22 09:02:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,574 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2019-10-22 09:02:13,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:02:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,577 INFO L225 Difference]: With dead ends: 956 [2019-10-22 09:02:13,577 INFO L226 Difference]: Without dead ends: 646 [2019-10-22 09:02:13,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-22 09:02:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2019-10-22 09:02:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-22 09:02:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2019-10-22 09:02:13,598 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2019-10-22 09:02:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,598 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2019-10-22 09:02:13,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2019-10-22 09:02:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:02:13,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,600 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2019-10-22 09:02:13,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980019141] [2019-10-22 09:02:13,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980019141] [2019-10-22 09:02:13,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864340278] [2019-10-22 09:02:13,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,637 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2019-10-22 09:02:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,666 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2019-10-22 09:02:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:02:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,673 INFO L225 Difference]: With dead ends: 1192 [2019-10-22 09:02:13,673 INFO L226 Difference]: Without dead ends: 1190 [2019-10-22 09:02:13,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-10-22 09:02:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2019-10-22 09:02:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-10-22 09:02:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2019-10-22 09:02:13,701 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2019-10-22 09:02:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,701 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2019-10-22 09:02:13,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2019-10-22 09:02:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:02:13,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,703 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2019-10-22 09:02:13,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029322532] [2019-10-22 09:02:13,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029322532] [2019-10-22 09:02:13,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418756544] [2019-10-22 09:02:13,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,731 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2019-10-22 09:02:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,768 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2019-10-22 09:02:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:02:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,775 INFO L225 Difference]: With dead ends: 2136 [2019-10-22 09:02:13,775 INFO L226 Difference]: Without dead ends: 1254 [2019-10-22 09:02:13,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-10-22 09:02:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2019-10-22 09:02:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-10-22 09:02:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2019-10-22 09:02:13,811 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2019-10-22 09:02:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,812 INFO L462 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2019-10-22 09:02:13,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2019-10-22 09:02:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 09:02:13,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,814 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,814 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2019-10-22 09:02:13,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388234219] [2019-10-22 09:02:13,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388234219] [2019-10-22 09:02:13,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799929143] [2019-10-22 09:02:13,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,840 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2019-10-22 09:02:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,866 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2019-10-22 09:02:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 09:02:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,871 INFO L225 Difference]: With dead ends: 1880 [2019-10-22 09:02:13,871 INFO L226 Difference]: Without dead ends: 1270 [2019-10-22 09:02:13,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-10-22 09:02:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2019-10-22 09:02:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-10-22 09:02:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2019-10-22 09:02:13,906 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2019-10-22 09:02:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,907 INFO L462 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2019-10-22 09:02:13,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2019-10-22 09:02:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 09:02:13,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,909 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,909 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2019-10-22 09:02:13,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669082876] [2019-10-22 09:02:13,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669082876] [2019-10-22 09:02:13,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636816150] [2019-10-22 09:02:13,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,930 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2019-10-22 09:02:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,961 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2019-10-22 09:02:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 09:02:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,969 INFO L225 Difference]: With dead ends: 2312 [2019-10-22 09:02:13,969 INFO L226 Difference]: Without dead ends: 2310 [2019-10-22 09:02:13,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-10-22 09:02:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2019-10-22 09:02:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-10-22 09:02:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2019-10-22 09:02:14,018 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2019-10-22 09:02:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,018 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2019-10-22 09:02:14,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2019-10-22 09:02:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 09:02:14,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,020 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,020 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2019-10-22 09:02:14,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384397699] [2019-10-22 09:02:14,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384397699] [2019-10-22 09:02:14,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:14,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147091680] [2019-10-22 09:02:14,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:14,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,052 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2019-10-22 09:02:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,100 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2019-10-22 09:02:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:14,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 09:02:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,110 INFO L225 Difference]: With dead ends: 4232 [2019-10-22 09:02:14,110 INFO L226 Difference]: Without dead ends: 2470 [2019-10-22 09:02:14,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-10-22 09:02:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2019-10-22 09:02:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-10-22 09:02:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2019-10-22 09:02:14,190 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2019-10-22 09:02:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,191 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2019-10-22 09:02:14,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2019-10-22 09:02:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:02:14,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,195 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2019-10-22 09:02:14,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163266933] [2019-10-22 09:02:14,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163266933] [2019-10-22 09:02:14,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:14,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572227063] [2019-10-22 09:02:14,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:14,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:14,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,222 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2019-10-22 09:02:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,262 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2019-10-22 09:02:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:14,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:02:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,271 INFO L225 Difference]: With dead ends: 3704 [2019-10-22 09:02:14,271 INFO L226 Difference]: Without dead ends: 2502 [2019-10-22 09:02:14,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-10-22 09:02:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2019-10-22 09:02:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-10-22 09:02:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2019-10-22 09:02:14,368 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2019-10-22 09:02:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,368 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2019-10-22 09:02:14,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2019-10-22 09:02:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:02:14,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,370 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,370 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2019-10-22 09:02:14,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112196612] [2019-10-22 09:02:14,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112196612] [2019-10-22 09:02:14,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:14,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267516993] [2019-10-22 09:02:14,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:14,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,389 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2019-10-22 09:02:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,435 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2019-10-22 09:02:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:14,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:02:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,450 INFO L225 Difference]: With dead ends: 4488 [2019-10-22 09:02:14,450 INFO L226 Difference]: Without dead ends: 4486 [2019-10-22 09:02:14,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-10-22 09:02:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2019-10-22 09:02:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-10-22 09:02:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2019-10-22 09:02:14,542 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2019-10-22 09:02:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,543 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2019-10-22 09:02:14,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2019-10-22 09:02:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:02:14,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,547 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,547 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2019-10-22 09:02:14,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703924123] [2019-10-22 09:02:14,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703924123] [2019-10-22 09:02:14,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:14,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314216539] [2019-10-22 09:02:14,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:14,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:14,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,566 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2019-10-22 09:02:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,637 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2019-10-22 09:02:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:14,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:02:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,657 INFO L225 Difference]: With dead ends: 8392 [2019-10-22 09:02:14,662 INFO L226 Difference]: Without dead ends: 4870 [2019-10-22 09:02:14,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-10-22 09:02:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2019-10-22 09:02:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-10-22 09:02:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2019-10-22 09:02:14,786 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2019-10-22 09:02:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,786 INFO L462 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2019-10-22 09:02:14,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2019-10-22 09:02:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:02:14,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,790 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2019-10-22 09:02:14,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574473814] [2019-10-22 09:02:14,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574473814] [2019-10-22 09:02:14,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:14,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639471664] [2019-10-22 09:02:14,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:14,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:14,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,809 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2019-10-22 09:02:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,876 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2019-10-22 09:02:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:14,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:02:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,894 INFO L225 Difference]: With dead ends: 7304 [2019-10-22 09:02:14,894 INFO L226 Difference]: Without dead ends: 4934 [2019-10-22 09:02:14,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-10-22 09:02:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-10-22 09:02:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-10-22 09:02:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2019-10-22 09:02:15,008 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2019-10-22 09:02:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:15,008 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2019-10-22 09:02:15,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2019-10-22 09:02:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:02:15,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:15,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:15,012 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2019-10-22 09:02:15,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:15,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481455556] [2019-10-22 09:02:15,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:15,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481455556] [2019-10-22 09:02:15,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:15,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:15,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327434248] [2019-10-22 09:02:15,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:15,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:15,035 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2019-10-22 09:02:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:15,134 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2019-10-22 09:02:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:15,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:02:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:15,151 INFO L225 Difference]: With dead ends: 8712 [2019-10-22 09:02:15,151 INFO L226 Difference]: Without dead ends: 8710 [2019-10-22 09:02:15,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-10-22 09:02:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2019-10-22 09:02:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2019-10-22 09:02:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2019-10-22 09:02:15,335 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2019-10-22 09:02:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:15,335 INFO L462 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2019-10-22 09:02:15,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2019-10-22 09:02:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:02:15,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:15,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:15,343 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2019-10-22 09:02:15,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:15,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115308410] [2019-10-22 09:02:15,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:15,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115308410] [2019-10-22 09:02:15,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:15,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:15,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484480912] [2019-10-22 09:02:15,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:15,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:15,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:15,370 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2019-10-22 09:02:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:15,514 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2019-10-22 09:02:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:15,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:02:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:15,537 INFO L225 Difference]: With dead ends: 16648 [2019-10-22 09:02:15,537 INFO L226 Difference]: Without dead ends: 9606 [2019-10-22 09:02:15,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-10-22 09:02:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2019-10-22 09:02:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-10-22 09:02:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2019-10-22 09:02:15,822 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2019-10-22 09:02:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:15,822 INFO L462 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2019-10-22 09:02:15,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2019-10-22 09:02:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:02:15,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:15,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:15,831 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2019-10-22 09:02:15,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:15,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638906805] [2019-10-22 09:02:15,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:15,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638906805] [2019-10-22 09:02:15,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:15,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:15,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475080335] [2019-10-22 09:02:15,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:15,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:15,853 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2019-10-22 09:02:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:15,957 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2019-10-22 09:02:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:15,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:02:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:15,973 INFO L225 Difference]: With dead ends: 14408 [2019-10-22 09:02:15,973 INFO L226 Difference]: Without dead ends: 9734 [2019-10-22 09:02:15,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-10-22 09:02:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2019-10-22 09:02:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-10-22 09:02:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2019-10-22 09:02:16,166 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2019-10-22 09:02:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:16,166 INFO L462 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2019-10-22 09:02:16,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2019-10-22 09:02:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:02:16,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:16,173 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:16,173 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2019-10-22 09:02:16,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429171944] [2019-10-22 09:02:16,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:16,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429171944] [2019-10-22 09:02:16,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:16,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:16,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251152170] [2019-10-22 09:02:16,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:16,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:16,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:16,191 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2019-10-22 09:02:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:16,328 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2019-10-22 09:02:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:16,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:02:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:16,358 INFO L225 Difference]: With dead ends: 16904 [2019-10-22 09:02:16,358 INFO L226 Difference]: Without dead ends: 16902 [2019-10-22 09:02:16,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-10-22 09:02:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2019-10-22 09:02:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-10-22 09:02:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2019-10-22 09:02:16,665 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2019-10-22 09:02:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:16,665 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2019-10-22 09:02:16,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2019-10-22 09:02:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:02:16,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:16,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:16,683 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2019-10-22 09:02:16,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127968600] [2019-10-22 09:02:16,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:16,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127968600] [2019-10-22 09:02:16,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:16,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:16,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942431674] [2019-10-22 09:02:16,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:16,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:16,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:16,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:16,713 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2019-10-22 09:02:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:16,991 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2019-10-22 09:02:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:16,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:02:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:17,022 INFO L225 Difference]: With dead ends: 33032 [2019-10-22 09:02:17,023 INFO L226 Difference]: Without dead ends: 18950 [2019-10-22 09:02:17,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2019-10-22 09:02:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2019-10-22 09:02:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-10-22 09:02:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2019-10-22 09:02:17,400 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2019-10-22 09:02:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:17,400 INFO L462 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2019-10-22 09:02:17,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2019-10-22 09:02:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:17,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:17,415 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:17,416 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2019-10-22 09:02:17,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:17,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007890704] [2019-10-22 09:02:17,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:17,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007890704] [2019-10-22 09:02:17,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:17,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:17,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951277782] [2019-10-22 09:02:17,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:17,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:17,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:17,433 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2019-10-22 09:02:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:17,619 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2019-10-22 09:02:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:17,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:17,652 INFO L225 Difference]: With dead ends: 28424 [2019-10-22 09:02:17,653 INFO L226 Difference]: Without dead ends: 19206 [2019-10-22 09:02:17,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-10-22 09:02:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2019-10-22 09:02:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-10-22 09:02:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2019-10-22 09:02:18,148 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2019-10-22 09:02:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:18,148 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2019-10-22 09:02:18,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2019-10-22 09:02:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:18,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:18,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:18,164 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2019-10-22 09:02:18,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:18,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415758250] [2019-10-22 09:02:18,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:18,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415758250] [2019-10-22 09:02:18,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:18,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:18,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955109325] [2019-10-22 09:02:18,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:18,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:18,200 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2019-10-22 09:02:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:18,473 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2019-10-22 09:02:18,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:18,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:18,531 INFO L225 Difference]: With dead ends: 32776 [2019-10-22 09:02:18,531 INFO L226 Difference]: Without dead ends: 32774 [2019-10-22 09:02:18,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2019-10-22 09:02:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2019-10-22 09:02:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2019-10-22 09:02:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2019-10-22 09:02:18,998 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2019-10-22 09:02:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:18,998 INFO L462 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2019-10-22 09:02:18,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2019-10-22 09:02:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:19,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:19,029 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:19,029 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:19,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2019-10-22 09:02:19,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:19,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273865304] [2019-10-22 09:02:19,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:19,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273865304] [2019-10-22 09:02:19,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:19,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:19,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115645940] [2019-10-22 09:02:19,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:19,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:19,047 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2019-10-22 09:02:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:19,618 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2019-10-22 09:02:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:19,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:19,662 INFO L225 Difference]: With dead ends: 65544 [2019-10-22 09:02:19,662 INFO L226 Difference]: Without dead ends: 37382 [2019-10-22 09:02:19,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2019-10-22 09:02:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2019-10-22 09:02:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2019-10-22 09:02:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2019-10-22 09:02:20,317 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2019-10-22 09:02:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:20,317 INFO L462 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2019-10-22 09:02:20,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2019-10-22 09:02:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:20,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:20,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:20,342 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2019-10-22 09:02:20,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875715985] [2019-10-22 09:02:20,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:20,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875715985] [2019-10-22 09:02:20,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:20,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:20,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943252038] [2019-10-22 09:02:20,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:20,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:20,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:20,356 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2019-10-22 09:02:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:20,664 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2019-10-22 09:02:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:20,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:02:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:20,724 INFO L225 Difference]: With dead ends: 56072 [2019-10-22 09:02:20,725 INFO L226 Difference]: Without dead ends: 37894 [2019-10-22 09:02:20,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2019-10-22 09:02:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2019-10-22 09:02:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2019-10-22 09:02:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2019-10-22 09:02:21,499 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2019-10-22 09:02:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:21,499 INFO L462 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2019-10-22 09:02:21,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2019-10-22 09:02:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:21,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:21,529 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:21,529 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2019-10-22 09:02:21,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130669978] [2019-10-22 09:02:21,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:21,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130669978] [2019-10-22 09:02:21,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:21,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004284221] [2019-10-22 09:02:21,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:21,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:21,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:21,542 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2019-10-22 09:02:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:22,082 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2019-10-22 09:02:22,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:22,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:02:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:22,168 INFO L225 Difference]: With dead ends: 110600 [2019-10-22 09:02:22,169 INFO L226 Difference]: Without dead ends: 73734 [2019-10-22 09:02:22,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-10-22 09:02:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2019-10-22 09:02:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2019-10-22 09:02:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-10-22 09:02:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2019-10-22 09:02:23,534 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2019-10-22 09:02:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:23,534 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2019-10-22 09:02:23,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2019-10-22 09:02:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:23,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:23,598 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,598 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2019-10-22 09:02:23,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041467087] [2019-10-22 09:02:23,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:23,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041467087] [2019-10-22 09:02:23,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:23,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105987876] [2019-10-22 09:02:23,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:23,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:23,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:23,619 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2019-10-22 09:02:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,100 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2019-10-22 09:02:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:02:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:24,191 INFO L225 Difference]: With dead ends: 79880 [2019-10-22 09:02:24,191 INFO L226 Difference]: Without dead ends: 79878 [2019-10-22 09:02:24,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-10-22 09:02:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2019-10-22 09:02:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-10-22 09:02:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2019-10-22 09:02:25,432 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2019-10-22 09:02:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:25,432 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2019-10-22 09:02:25,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2019-10-22 09:02:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:02:25,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:25,474 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,475 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2019-10-22 09:02:25,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960063079] [2019-10-22 09:02:25,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:25,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960063079] [2019-10-22 09:02:25,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:25,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643880497] [2019-10-22 09:02:25,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:25,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,491 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2019-10-22 09:02:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,315 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2019-10-22 09:02:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:26,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 09:02:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:26,422 INFO L225 Difference]: With dead ends: 121864 [2019-10-22 09:02:26,422 INFO L226 Difference]: Without dead ends: 121862 [2019-10-22 09:02:26,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2019-10-22 09:02:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2019-10-22 09:02:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2019-10-22 09:02:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2019-10-22 09:02:28,044 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2019-10-22 09:02:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:28,044 INFO L462 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2019-10-22 09:02:28,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2019-10-22 09:02:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:02:28,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:28,099 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:28,099 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2019-10-22 09:02:28,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92963825] [2019-10-22 09:02:28,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:28,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92963825] [2019-10-22 09:02:28,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:28,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:28,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210441180] [2019-10-22 09:02:28,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:28,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:28,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:28,118 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2019-10-22 09:02:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,151 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2019-10-22 09:02:31,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:31,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 09:02:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:31,266 INFO L225 Difference]: With dead ends: 257032 [2019-10-22 09:02:31,266 INFO L226 Difference]: Without dead ends: 144390 [2019-10-22 09:02:31,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2019-10-22 09:02:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2019-10-22 09:02:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2019-10-22 09:02:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2019-10-22 09:02:32,575 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2019-10-22 09:02:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,576 INFO L462 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2019-10-22 09:02:32,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2019-10-22 09:02:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:02:32,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,647 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,647 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2019-10-22 09:02:32,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734350741] [2019-10-22 09:02:32,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:32,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734350741] [2019-10-22 09:02:32,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:32,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828440730] [2019-10-22 09:02:32,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:32,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:32,668 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2019-10-22 09:02:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,937 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2019-10-22 09:02:33,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 09:02:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:34,064 INFO L225 Difference]: With dead ends: 218120 [2019-10-22 09:02:34,064 INFO L226 Difference]: Without dead ends: 147462 [2019-10-22 09:02:34,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2019-10-22 09:02:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2019-10-22 09:02:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2019-10-22 09:02:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2019-10-22 09:02:36,310 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2019-10-22 09:02:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:36,310 INFO L462 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2019-10-22 09:02:36,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2019-10-22 09:02:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:02:36,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:36,374 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:36,374 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2019-10-22 09:02:36,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953292285] [2019-10-22 09:02:36,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:36,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953292285] [2019-10-22 09:02:36,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:36,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:36,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700736528] [2019-10-22 09:02:36,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:36,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:36,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:36,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:36,398 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2019-10-22 09:02:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:37,505 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2019-10-22 09:02:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:37,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 09:02:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:37,716 INFO L225 Difference]: With dead ends: 237574 [2019-10-22 09:02:37,716 INFO L226 Difference]: Without dead ends: 237572 [2019-10-22 09:02:37,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2019-10-22 09:02:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2019-10-22 09:02:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2019-10-22 09:02:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2019-10-22 09:02:40,654 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2019-10-22 09:02:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:40,654 INFO L462 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2019-10-22 09:02:40,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2019-10-22 09:02:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:02:40,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:40,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:40,783 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2019-10-22 09:02:40,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857738597] [2019-10-22 09:02:40,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857738597] [2019-10-22 09:02:40,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:40,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:40,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266335188] [2019-10-22 09:02:40,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:40,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:40,801 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2019-10-22 09:02:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:42,443 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2019-10-22 09:02:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:42,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 09:02:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:42,444 INFO L225 Difference]: With dead ends: 512004 [2019-10-22 09:02:42,444 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:02:42,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:02:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:02:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:02:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:02:42,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-22 09:02:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:42,557 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:42,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:42,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:02:42,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:02:42,586 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-22 09:02:42,586 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,586 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L446 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,587 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-10-22 09:02:42,588 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,589 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-10-22 09:02:42,590 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-22 09:02:42,591 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,591 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,591 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-10-22 09:02:42,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:42 BoogieIcfgContainer [2019-10-22 09:02:42,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:42,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:42,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:42,603 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:42,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:12" (3/4) ... [2019-10-22 09:02:42,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:02:42,621 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 09:02:42,624 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:02:42,682 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_019cfe79-d619-4443-af3c-a5862d0832e2/bin/uautomizer/witness.graphml [2019-10-22 09:02:42,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:42,687 INFO L168 Benchmark]: Toolchain (without parser) took 31270.99 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 945.8 MB in the beginning and 736.7 MB in the end (delta: 209.1 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-10-22 09:02:42,687 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:42,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:42,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:42,688 INFO L168 Benchmark]: Boogie Preprocessor took 49.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:42,688 INFO L168 Benchmark]: RCFGBuilder took 397.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:42,688 INFO L168 Benchmark]: TraceAbstraction took 30351.20 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 757.1 MB in the end (delta: 338.5 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-10-22 09:02:42,689 INFO L168 Benchmark]: Witness Printer took 82.47 ms. Allocated memory is still 4.6 GB. Free memory was 757.1 MB in the beginning and 736.7 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:42,690 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 397.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30351.20 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 757.1 MB in the end (delta: 338.5 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 82.47 ms. Allocated memory is still 4.6 GB. Free memory was 757.1 MB in the beginning and 736.7 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: 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, 48 locations, 1 error locations. Result: SAFE, OverallTime: 30.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 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.6s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...